Sciweavers

70 search results - page 8 / 14
» Approximate Nash Equilibria under Stability Conditions
Sort
View
ICC
2009
IEEE
148views Communications» more  ICC 2009»
14 years 2 months ago
A Game-Theoretic Analysis of Inter-Session Network Coding
Abstract— A common assumption in the network coding literature is that the users are cooperative and will not pursue their own interests. However, this assumption can be violated...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W...
TON
2010
157views more  TON 2010»
13 years 2 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle
AAAI
2010
13 years 7 months ago
Algorithms for Finding Approximate Formations in Games
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...
Patrick R. Jordan, Michael P. Wellman
NIPS
2007
13 years 9 months ago
Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria
We study the relation between notions of game-theoretic equilibria which are based on stability under a set of deviations, and empirical equilibria which are reached by rational p...
Elad Hazan, Satyen Kale
AAAI
2010
13 years 9 months ago
Convergence to Equilibria in Plurality Voting
Multi-agent decision problems, in which independent agents have to agree on a joint plan of action or allocation of resources, are central to AI. In such situations, agents' ...
Reshef Meir, Maria Polukarov, Jeffrey S. Rosensche...