The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. Informally, a weakly acyclic game is on...
Alex Fabrikant, Aaron D. Jaggard, Michael Schapira
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such ...
Reshef Meir, Yoram Bachrach, Jeffrey S. Rosenschei...