594 search results - page 20 / 119 » Games with Secure Equilibria |
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
DIALM
2003
ACM
14 years 29 days ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
FOCS
2007
IEEE
14 years 2 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...
UAI
2004
13 years 9 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
TAMC
2010
Springer
14 years 23 days ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every