Related papers: An analysis of Bennett's pebble game
This paper aims to solve the optimal strategy against a well-known adaptive algorithm, the Hedge algorithm, in a finitely repeated $2\times 2$ zero-sum game. In the literature, related theoretical results are very rare. To this end, we make…
We consider the strategic interaction of traders in a continuous-time financial market with Epstein-Zin-type recursive intertemporal preferences and performance concerns. We derive explicitly an equilibrium for the finite player and the…
The off-switch game is a game theoretic model of a highly intelligent robot interacting with a human. In the original paper by Hadfield-Menell et al. (2016), the analysis is not fully game-theoretic as the human is modelled as an irrational…
This note, suitable for a lecture in an advanced undergraduate or basic graduate course on the economic theory of networks, exposits basic ideas of linear best-response games and their equilibria.
Recent successes of game-theoretic formulations in ML have caused a resurgence of research interest in differentiable games. Overwhelmingly, that research focuses on methods and upper bounds on their speed of convergence. In this work, we…
We consider a large population dynamic game in discrete time where players are characterized by time-evolving types. It is a natural assumption that the players' actions cannot anticipate future values of their types. Such games go under…
We show, under weaker assumptions than in the previous literature, that a perpetual optimal stopping game always has a value. We also show that there exists an optimal stopping time for the seller, but not necessarily for the buyer.…
We study a setting in which two players play a (possibly approximate) Nash equilibrium of a bimatrix game, while a learner observes only their actions and has no knowledge of the equilibrium or the underlying game. A natural question is…
Infinitely repeated games can support cooperative outcomes that are not equilibria in the one-shot game. The idea is to make sure that any gains from deviating will be offset by retaliation in future rounds. However, this model of…
We propose a continuous version of the classical Gale--Berlekamp switching game. We also study a weighted version of this new continuous game. The main results of this paper concern growth estimates for the corresponding optimization…
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that one-clock priced timed games can be solved in time m 12^n n^(O(1)), where n is…
In Zeng et al. [Fluct. Noise Lett. 7 (2007) L439--L447] the analysis of the lowest unique positive integer game is simplified by some reasonable assumptions that make the problem tractable for arbitrary numbers of players. However, here we…
This paper takes a game theoretical approach to open shop scheduling problems with unit execution times to minimize the sum of completion times. By supposing an initial schedule and associating each job (consisting in a number of…
We study the problem of super-replication for game options under proportional transaction costs. We consider a multidimensional continuous time model, in which the discounted stock price process satisfies the conditional full support…
The window mechanism was introduced by Chatterjee et al. to reinforce mean-payoff and total-payoff objectives with time bounds in two-player turn-based games on graphs. It has since proved useful in a variety of settings, including parity…
We introduce and analyze a variation of the Bertrand game in which the revenue is shared between two players. This game models situations in which one economic agent can provide goods/services to consumers either directly or through an…
Polynomial time reductions between problems have long been used to delineate problem classes. Simulation reductions also exist, where an oracle for simulation from some probability distribution can be employed together with an oracle for…
Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…
We consider a special, geometric case of a balancing game introduced by Spencer in 1977. Consider any arrangement $\mathcal{L}$ of $n$ lines in the plane, and assume that each cell of the arrangement contains a box. Alice initially places…
We consider the classical question of predicting binary sequences and study the {\em optimal} algorithms for obtaining the best possible regret and payoff functions for this problem. The question turns out to be also equivalent to the…