AAAI
2011
12 years 11 months ago
2011
The standard approach to computing an optimal mixed strategy to commit to is based on solving a set of linear programs, one for each of the follower’s pure strategies. We show t...
SIGECOM
2011
ACM
13 years 2 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
MSS
2008
IEEE
13 years 11 months ago
2008
IEEE
We show on a 4
JAIR
2008
13 years 11 months ago
2008
Correlated equilibrium generalizes Nash equilibrium to allow correlation devices. Correlated equilibrium captures the idea that in many systems there exists a trusted administrato...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the co...
IJCAI
2007
14 years 28 days ago
2007
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
PODC
1995
ACM
14 years 3 months ago
1995
ACM
We show how solution concepts in games such as Nash equilibrium, correlated equilibrium, rationalizability, and sequential equilibrium can be given a uniform definition in terms ...