We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
Aaron Roth, Maria-Florina Balcan, Adam Kalai, Yish...
In contrast to classical game theoretic analysis of simultaneous and sequential play in bimatrix games, Steven Brams has proposed an alternative framework called the Theory of Mov...
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, T...
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...
— Separable games are a structured subclass of continuous games whose payoffs take a sum-of-products form; the zero-sum case has been studied in earlier work. Included in this su...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...