2 citations · 2 across the 3 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2008★ 2 cited
On the Complexity of Nash Equilibria of Action-Graph Games
Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant +1
We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that encapsulate…
cs.GT2007
Computing Equilibria in Anonymous Games
Constantinos Daskalakis, Christos Papadimitriou
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentiate…