129 search results - page 10 / 26 » Games, geometry, and the computational complexity of finding... |
150
click to vote
SIGECOM
2006
ACM
15 years 12 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
151
click to vote
PERCOM
2009
ACM
16 years 6 months ago
2009
ACM
In pervasive computing environments, personal information is expressed in digital forms to a great extent. Daily activities and personal preferences may be easily associated with p...
158
click to vote
AAAI
2006
15 years 7 months ago
2006
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...
146
click to vote
ATAL
2007
Springer
16 years 6 days ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
163
click to vote
FOCS
2009
IEEE
16 years 24 days ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...