Sciweavers

8 search results - page 1 / 2
» The communication complexity of uncoupled nash equilibrium p...
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 5 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
ICML
2004
IEEE
14 years 5 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
INFOCOM
2009
IEEE
13 years 11 months ago
Interference-Aware MAC Protocol for Wireless Networks by a Game-Theoretic Approach
—We propose an interference-aware MAC protocol using a simple transmission strategy motivated by a gametheoretic approach. We formulate a channel access game, which considers nod...
HyungJune Lee, Hyukjoon Kwon, Arik Motskin, Leonid...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 10 months ago
Equilibria in topology control games for ad hoc networks
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...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust