3274 search results - page 90 / 655 » Communication strategies in games |
CCGRID
2007
IEEE
14 years 4 months ago
2007
IEEE
Massively Multiplayer Online Games have become increasingly popular. However, their operation is costly, as game servers must be maintained. To reduce these costs, we aim at provi...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
AAAI
2004
13 years 11 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
AAAI
2010
13 years 10 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...
SAGT
2009
Springer
14 years 4 months ago
2009
Springer
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...