2 citations · 2 across the 3 of their papers we have counts for
3 papers
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…
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…
Sorting and Selection in Posets
Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel +2
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs…