Related papers: Least-Squares Prices of Games
Coin-flipping is a fundamental task in two-party cryptography where two remote mistrustful parties wish to generate a shared uniformly random bit. While quantum protocols promising near-perfect security exist for weak coin-flipping -- when…
In this paper the set of value functions of all-possible zero-sum differential games with terminal payoff is characterized. The necessary and sufficient condition for a given function to be a value of some differential game with terminal…
We consider a market impact game for $n$ risk-averse agents that are competing in a market model with linear transient price impact and additional transaction costs. For both finite and infinite time horizons, the agents aim to minimize a…
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within $\epsilon$ in time exponential in a polynomial in the size of the game times polynomial in logarithmic in…
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…
We provide several tests to determine whether a game is a potential game or whether it is a zero-sum equivalent game---a game which is strategically equivalent to a zero-sum game in the same way that a potential game is strategically…
Quantitative games are two-player zero-sum games played on directed weighted graphs. Total-payoff games (that can be seen as a refinement of the well-studied mean-payoff games) are the variant where the payoff of a play is computed as the…
We study a toy two-player game for periodic double auction markets to generate liquidity. The game has imperfect information, which allows us to link market spreads with signal strength. We characterize Nash equilibria in cases with or…
Mean-payoff games are important quantitative models for open reactive systems. They have been widely studied as games of full observation. In this paper we investigate the algorithmic properties of several sub-classes of mean-payoff games…
A new definition of events of game-theoretic probability zero in continuous time is proposed and used to prove results suggesting that trading in financial markets results in the emergence of properties usually associated with randomness.…
We propose a numerical method for stationary Mean Field Games defined on a network. In this framework a correct approximation of the transition conditions at the vertices plays a crucial role. We prove existence, uniqueness and convergence…
An investor trades a safe and several risky assets with linear price impact to maximize expected utility from terminal wealth. In the limit for small impact costs, we explicitly determine the optimal policy and welfare, in a general…
Hierarchical simple games - both disjunctive and conjunctive - are natural generalizations of simple majority games. They take their origin in the theory of secret sharing. Another important generalization of simple majority games with…
We study the inefficiency of equilibria for various classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i's perceived cost is a convex combination of 1-\alpha_i times his direct…
A finite impartial game is a two-player game in which the players take turns making moves and the game ends after finitely many moves. In this paper, we study a class of finite impartial games introduced by H.~Lenstra, which we call coin…
Parsimonious games are a subset of constant sum homogeneous weighted majority games unequivocally described by their free type representation vector. We show that the minimal winning quota of parsimonious games satisfies a second order,…
In this note we consider the maximization of the expected terminal wealth for the setup of quadratic transaction costs. First, we provide a very simple probabilistic solution to the problem. Although the problem was largely studied, as far…
The pricing, hedging, optimal exercise and optimal cancellation of game or Israeli options are considered in a multi-currency model with proportional transaction costs. Efficient constructions for optimal hedging, cancellation and exercise…
Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players, Player Min and Player Max, by moving a token along the states of the graph to form an infinite…
A simple but nontrivial class of the quantum strategies in buying-selling games is presented. The player moves are a rational buying and an unconditional selling. The possibility of gaining extremal profits in such the games is considered.…