Related papers: Subgame-perfect Equilibria in Mean-payoff Games (j…

In~[1],authors considered a general finite horizon model of dynamic game of asymmetric information, where N players have types evolving as independent Markovian process, where each player observes its own type perfectly and actions of all…

Canonical models of Markov decision processes (MDPs) usually consider geometric discounting based on a constant discount factor. While this standard modeling approach has led to many elegant results, some recent studies indicate the…

We investigate how well continuous-time fictitious play in two-player games performs in terms of average payoff, particularly compared to Nash equilibrium payoff. We show that in many games, fictitious play outperforms Nash equilibrium on…

A new concept of an equilibrium in games is introduced that solves an open question posed by A. Neyman.

We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations…

We apply Blackwell optimality to repeated games. An equilibrium whose strategy profile is sequentially rational for all high enough discount factors simultaneously is a Blackwell (subgame-perfect, perfect public, etc.) equilibrium. The bite…

In the literature on game-theoretic equilibrium finding, focus has mainly been on solving a single game in isolation. In practice, however, strategic interactions -- ranging from routing problems to online advertising auctions -- evolve…

Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of…

This paper proposes a finite-horizon approximation scheme and introduces episodic equilibrium as a solution concept for stochastic games (SGs), where agents strategize based on the current state and episode stage. The paper also establishes…

Negotiations, a model of concurrency with multi party negotiation as primitive, have been recently introduced in arXiv:1307.2145, arXiv:1403.4958. We initiate the study of games for this model. We study coalition problems: can a given…

We introduce a model of sender-receiver stopping games, where the state of the world follows an iid--process throughout the game. At each period, the sender observes the current state, and sends a message to the receiver, suggesting either…

Strategic games admit a multi-graph representation, in which two kinds of relations, accessibility, and preferences, are used to describe how the players compare the possible outcomes. A category of games with a fixed set of players…

We investigate an infinite-horizon time-inconsistent mean-field game (MFG) in a discrete time setting. We first present a classic equilibrium for the MFG and its associated existence result. This classic equilibrium aligns with the…

The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the follower) plays a best response to this strategy (ties are broken…

The known results regarding two-player zero-sum games are naturally generalized in complex space and are presented through a complete compact theory. The payoff function is defined by the real part of the payoff function in the real case,…

Negotiations, a model of concurrency with multi party negotiation as primitive, have been recently introduced by J. Desel and J. Esparza. We initiate the study of games for this model. We study coalition problems: can a given coalition of…

We introduce a set-valued solution concept, M equilibrium, to capture empirical regularities from over half a century of game-theory experiments. We show M equilibrium serves as a meta theory for various models that hitherto were considered…

We consider zero-sum stochastic games with perfect information and finitely many states and actions. The payoff is computed by a function which associates to each infinite sequence of states and actions a real number. We prove that if the…

We are interested in the study of stochastic games for which each player faces an optimal stopping problem. In our setting, the players may interact through the criterion to optimise as well as through their dynamics. After briefly…

Subtraction games have a rich literature as normal-play combinatorial games (e.g., Berlekamp, Conway, and Guy, 1982). Recently, the theory has been extended to zero-sum scoring play (Cohensius et al. 2019). Here, we take the approach of…