Sciweavers

224 search results - page 38 / 45
» On Nash-Equilibria of Approximation-Stable Games
Sort
View
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
13 years 9 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
INFOCOM
2011
IEEE
12 years 11 months ago
Pricing-based spectrum access control in cognitive radio networks with random access
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
Lei Yang, Hongseok Kim, Junshan Zhang, Mung Chiang...
ATAL
2009
Springer
14 years 2 months ago
Multiagent learning in large anonymous games
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ï...
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
STACS
2007
Springer
14 years 1 months ago
Symmetries and the Complexity of Pure Nash Equilibrium
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
Felix Brandt, Felix A. Fischer, Markus Holzer
BIRTHDAY
2009
Springer
14 years 2 months ago
Asynchronous Congestion Games
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
Michal Penn, Maria Polukarov, Moshe Tennenholtz