In this paper we give necessary and sufficient conditions for a simple game to have rough weights. We define two functions f (n) and g(n) that measure the deviation of a simple game from a weighted majority game and roughly weighted majority game, respectively. We formulate known results in terms of
Weighted search games
✍ Scribed by N. Zoroa; P. Zoroa; M.J. Fernández-Sáez
- Book ID
- 108118546
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 281 KB
- Volume
- 195
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Search games and rendezvous problems have received growing attention in computer science within the past few years. Rendezvous problems emerge naturally, for instance, to optimize performance and convergence of mobile robots. This gives a new algorithmic point of view to the theory. Furthermore, mo
Search games and rendezvous problems have received growing attention in computer science within the past few years. Rendezvous problems emerge naturally, for instance, to optimize performance and convergence of mobile robots. This gives a new algorithmic point of view to the theory. Furthermore, mo