We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
Michael J. Kearns, Michael L. Littman, Satinder P....
We consider the price of stability for Nash and correlated equilibria of linear congestion games. The price of stability is the optimistic price of anarchy, the ratio of the cost ...
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...