Sciweavers

5995 search results - page 31 / 1199
» Algorithmic Game Theory
Sort
View
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
14 years 11 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
ICRA
2010
IEEE
215views Robotics» more  ICRA 2010»
14 years 10 months ago
Moving game theoretical patrolling strategies from theory to practice: An USARSim simulation
— Game theoretical approaches have been recently used to develop patrolling strategies for mobile robots. The idea is that the patroller and the intruder play a game, whose outco...
Francesco Amigoni, Nicola Basilico, Nicola Gatti, ...
ATAL
2010
Springer
15 years 18 days ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
14 years 11 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
ATAL
2006
Springer
15 years 3 months ago
Model checking knowledge, strategies, and games in multi-agent systems
We present an OBDD-based methodology for verifying time, knowledge, and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we invest...
Alessio Lomuscio, Franco Raimondi