Sciweavers

399 search results - page 20 / 80
» Games with Congestion-Averse Utilities
Sort
View
JAIR
2008
96views more  JAIR 2008»
15 years 1 months ago
On the Value of Correlation
Correlated equilibrium generalizes Nash equilibrium to allow correlation devices. Correlated equilibrium captures the idea that in many systems there exists a trusted administrato...
Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
16 years 2 months ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav
CORR
2008
Springer
217views Education» more  CORR 2008»
15 years 2 months ago
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks
Abstract-- This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge ...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
144
Voted
ATAL
2010
Springer
15 years 3 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
DIGRA
2005
Springer
15 years 7 months ago
Towards an Ontological Language for Game Analysis
The Game Ontology Project (GOP) is creating a framework for describing, analyzing and games, by defining a hierarchy of concepts abstracted from an analysis of many specific games...
José Pablo Zagal, Michael Mateas, Clara Fer...