English
Related papers

Related papers: Discrete Two Player All-Pay Auction with Complete …

200 papers

We prove for every $n\ge4$ the existence of an $n$-player game in normal form with integer payoffs that has a unique Nash equilibrium, which is fully mixed. In the equilibrium, each probability weight is an algebraic number of degree…

Computer Science and Game Theory · Computer Science 2026-05-27 Edan Orzech , Martin Rinard

We study a multi-player stochastic differential game, where agents interact through their joint price impact on an asset that they trade to exploit a common trading signal. In this context, we prove that a closed-loop Nash equilibrium…

Mathematical Finance · Quantitative Finance 2023-06-23 Alessandro Micheli , Johannes Muhle-Karbe , Eyal Neuman

In finite games mixed Nash equilibria always exist, but pure equilibria may fail to exist. To assess the relevance of this nonexistence, we consider games where the payoffs are drawn at random. In particular, we focus on games where a large…

Computer Science and Game Theory · Computer Science 2020-06-18 Ben Amiet , Andrea Collevecchio , Marco Scarsini , Ziwen Zhong

The preferences of players in non-cooperative games represent their choice in the set of available options, which meet the completeness property if players are able to compare any pair of available options. In the existing literature, the…

Optimization and Control · Mathematics 2023-02-20 Asrifa Sultana , Shivani Valecha

We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in randomised strategies is undecidable, while the existence of a…

Computer Science and Game Theory · Computer Science 2011-09-29 Michael Ummels , Dominik Wojtczak

We consider graphical $n$-person games with perfect information that have no Nash equilibria in pure stationary strategies. Solving these games in mixed strategies, we introduce probabilistic distributions in all non-terminal positions. The…

Combinatorics · Mathematics 2023-08-21 Vladimir Gurvich , Mariya Naumova

We study optimal equilibria in multi-player games. An equilibrium is optimal for a player, if her payoff is maximal. A tempting approach to solving this problem is to seek optimal Nash equilibria, the standard form of equilibria where no…

Computer Science and Game Theory · Computer Science 2013-07-09 Anshul Gupta , Sven Schewe

We investigate the existence of certain types of equilibria (Nash, $\varepsilon$-Nash, subgame perfect, $\varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental…

Logic in Computer Science · Computer Science 2016-03-18 Stéphane Le Roux , Arno Pauly

An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…

Computer Science and Game Theory · Computer Science 2013-08-01 Leslie Ann Goldberg , Paul W. Goldberg , Piotr Krysta , Carmine Ventre

At a mixed Nash equilibrium, the payoff of a player does not depend on her own action, as long as her opponent sticks to his. In a periodic strategy, a concept developed in a previous paper (arXiv:1307.2035v4), in contrast, the own payoff…

Computer Science and Game Theory · Computer Science 2020-05-27 V. K. Oikonomou , J. Jost

We investigate stochastic differential games of optimal trading comprising a finite population. There are market frictions in the present framework, which take the form of stochastic permanent and temporary price impacts. Moreover,…

Mathematical Finance · Quantitative Finance 2021-02-09 David Evangelista , Yuri Thamsten

We propose a new dynamics for equilibrium selection of finite player discrete strategy games. The dynamics is motivated by optimal transportation, and models individual players' myopicity, greedy and uncertainty when making decisions. The…

Optimization and Control · Mathematics 2017-07-26 Shui-Nee Chow , Wuchen Li , Jun Lu , Haomin Zhou

All-pay auctions, a common mechanism for various human and agent interactions, suffers, like many other mechanisms, from the possibility of players' failure to participate in the auction. We model such failures, and fully characterize…

Computer Science and Game Theory · Computer Science 2017-02-15 Yoad Lewenberg , Omer Lev , Yoram Bachrach , Jeffrey S. Rosenschein

We study equilibrium concepts in non-cooperative games under uncertainty where both beliefs and mixed strategies are represented by non-additive measures (capacities). In contrast to the classical Nash framework based on additive…

Computer Science and Game Theory · Computer Science 2026-03-06 Taras Radul

The game of \emph{Showcase Showdown} with unlimited spins is investigated as an $n$-players continuous game, and the Nash Equilibrium strategies for the players are obtained. The sequential game with information on the results of the…

Optimization and Control · Mathematics 2025-04-15 L. Bayón , P. Fortuny ayuso , J. M. Grau , A. M. Oller-Marcén , M. M Ruíz

The paper is concerned with a two-player nonzero-sum differential game in the case when players are informed about the current position. We consider the game in control with guide strategies first proposed by Krasovskii and Subbotin. The…

Optimization and Control · Mathematics 2013-06-11 Yurii Averboukh

We use vector bundles to study the locus of totally mixed Nash equilibria of an $n$-player game in normal form, which we call the Nash equilibrium scheme. When the payoff tensor format is balanced, we study the Nash discriminant variety,…

Computer Science and Game Theory · Computer Science 2026-01-16 Hirotachi Abo , Irem Portakal , Luca Sodomaco

We construct Nash equilibria in feedback form for a class of two-person stochastic games of singular control with absorption, arising from a stylized model for corporate finance. More precisely, the paper focusses on a strategic dynamic…

Optimization and Control · Mathematics 2025-07-04 Tiziano De Angelis , Fabien Gensbittel , Stéphane Villeneuve

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

Computer Science and Game Theory · Computer Science 2017-01-03 Stéphane Le Roux , Arno Pauly

Many important real-world settings contain multiple players interacting over an unknown duration with probabilistic state transitions, and are naturally modeled as stochastic games. Prior research on algorithms for stochastic games has…

Computer Science and Game Theory · Computer Science 2021-02-19 Sam Ganzfried