English
Related papers

Related papers: A complete solution for a nontrivial ruleset with …

200 papers

We study zero-sum games, a variant of the classical combinatorial Subtraction games (studied for example in the monumental work "Winning Ways", by Berlekamp, Conway and Guy), called Cumulative Subtraction (CS). Two players alternate in…

Combinatorics · Mathematics 2020-02-14 Gal Cohensius , Urban Larsson , Reshef Meir , David Wahlstedt

First, we consider the problem of deciding whether a nonlocal game admits a perfect entangled strategy that uses projective measurements on a maximally entangled shared state. Via a polynomial-time Karp reduction, we show that independent…

Quantum Physics · Physics 2015-06-26 Laura Mančinska , David E. Roberson , Antonios Varvitsiotis

Heifetz, Meier, and Schipper (2013) introduced dynamic game with unawareness consisting of a partially ordered set of games in extensive form. Here, we study the normal form of dynamic games with unawareness. The generalized normal form…

Computer Science and Game Theory · Computer Science 2026-05-01 Burkhard C. Schipper

In this tutorial, the basics of game theory are introduced along with an overview of its most recent and emerging applications in signal processing. One of the main features of this contribution is to gather in a single paper some…

Computer Science and Game Theory · Computer Science 2015-07-06 Giacomo Bacci , Samson Lasaulce , Walid Saad , Luca Sanguinetti

The application of the methods of quantum mechanics to game theory provides us with the ability to achieve results not otherwise possible. Both linear superpositions of actions and entanglement between the players' moves can be exploited.…

Quantum Physics · Physics 2007-05-23 Adrian P. Flitney , Derek Abbott

Positional games are a well-studied class of combinatorial game. In their usual form, two players take turns to play moves in a set (`the board'), and certain subsets are designated as `winning': the first person to occupy such a set wins…

Combinatorics · Mathematics 2016-07-12 J. Robert Johnson , Imre Leader , Mark Walters

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

Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…

Computer Science and Game Theory · Computer Science 2010-04-30 Pierre Lescanne , Perrinel Matthieu

Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…

Computer Science and Game Theory · Computer Science 2011-12-16 Pierre Lescanne , Perrinel Matthieu

Dynamic noncooperative game theory is a field of mathematics and economics in which a lot of research is being carried out at present featuring a great number of applications in many different areas of economics and management science like…

Optimization and Control · Mathematics 2014-09-19 Philipp Hungerländer

We study combinatorial games under mis\`ere convention. Several sets of games have been considered earlier to better understand the behaviour of mis\`ere games. We here connect several of these sets. In particular, we prove that comparison…

Combinatorics · Mathematics 2014-05-14 Gabriel Renault

Repeated games have a long tradition in the behavioral sciences and evolutionary biology. Recently, strategies were discovered that permit an unprecedented level of control over repeated interactions by enabling a player to unilaterally…

Populations and Evolution · Quantitative Biology 2016-10-25 Alex McAvoy , Christoph Hauert

Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…

Computer Science and Game Theory · Computer Science 2024-05-14 Zihui Liang , Bakh Khoussainov , Mingyu Xiao

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…

Logic in Computer Science · Computer Science 2015-07-30 Javier Esparza , Philipp Hoffmann

We introduce and analyze the ordered Zeckendorf game, a novel combinatorial two-player game inspired by Zeckendorf's Theorem, which guarantees a unique decomposition of every positive integer as a sum of non-consecutive Fibonacci numbers.…

Number Theory · Mathematics 2026-03-31 Ivan Bortnovskyi , Michael Lucas , Steven J. Miller , Iana Vranesko , Ren Watson , Cameron White

Inverse game theory is utilized to infer the cost functions of all players based on game outcomes. However, existing inverse game theory methods do not consider the learner as an active participant in the game, which could significantly…

Computer Science and Game Theory · Computer Science 2025-10-20 Jianguo Chen , Jinlong Lei , Biqiang Mu , Yiguang Hong , Hongsheng Qi

For non-monotone single and two-populations time-dependent Mean-Field Game systems we obtain the existence of an infinite number of branches of non-trivial solutions. These non-trivial solutions are in particular shown to exhibit an…

Analysis of PDEs · Mathematics 2018-12-20 Marco Cirant

In this note, we consider repeated play of a finite game using learning rules whose period-by-period behavior probabilities or empirical distributions converge to some notion of equilibria of the stage game. Our primary focus is on…

Computer Science and Game Theory · Computer Science 2013-10-22 M. Sadegh Talebi

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…

Logic in Computer Science · Computer Science 2015-09-25 Philipp Hoffmann

We study two impartial games introduced by Anderson and Harary and further developed by Barnes. Both games are played by two players who alternately select previously unselected elements of a finite group. The first player who builds a…

Combinatorics · Mathematics 2024-02-12 Dana C. Ernst , Nandor Sieben