533 search results - page 14 / 107 » Playing games with approximation algorithms |
STOC
2001
ACM
14 years 7 months ago
2001
ACM
CG
2002
Springer
13 years 7 months ago
2002
Springer
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
AAAI
2010
13 years 7 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
ALGOSENSORS
2009
Springer
14 years 2 months ago
2009
Springer
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
SIGECOM
2010
ACM
13 years 7 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....