English
Related papers

Related papers: Infinite games with uncertain moves

200 papers

This paper extends Berge's maximum theorem for possibly noncompact action sets and unbounded cost functions to minimax problems and studies applications of these extensions to two-player zero-sum games with possibly noncompact action sets…

Optimization and Control · Mathematics 2017-09-14 Eugene A. Feinberg , Pavlo O. Kasyanov , Michael Z. Zgurovsky

We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…

Computer Science and Game Theory · Computer Science 2012-07-03 Krishnendu Chatterjee , Martin Chmelik , Rupak Majumdar

A notion of combinatorial game over a partially ordered set of atomic outcomes was recently introduced by Selinger. These games are appropriate for describing the value of positions in Hex and other monotone set coloring games. It is…

Combinatorics · Mathematics 2022-03-29 Eric Demer , Peter Selinger

In a zero-sum stochastic game with signals, at each stage, two adversary players take decisions and receive a stage payoff determined by these decisions and a variable called state. The state follows a Markov chain, that is controlled by…

Optimization and Control · Mathematics 2021-12-02 Bruno Ziliotto

Standard game theory assumes that the structure of the game is common knowledge among players. We relax this assumption by considering extensive games where agents may be unaware of the complete structure of the game. In particular, they…

Computer Science and Game Theory · Computer Science 2007-05-23 Joseph Y. Halpern , Leandro C. Rêgo

Something is definitely wrong. If the game has a linear winning strategy, then it is tractable. What's going on? Well, we describe a two-person game which has a definite winner, that is, a player who can force a win in a finite number of…

Combinatorics · Mathematics 2016-09-07 Aviezri S. Fraenkel

Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…

Computer Science and Game Theory · Computer Science 2023-10-31 Prem Kant , Urban Larsson , Ravi K. Rai , Akshay V. Upasany

Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…

Statistical Mechanics · Physics 2007-05-23 F. K. Chow , H. F. Chau

A poset game is a two-player game played over a partially ordered set (poset) in which the players alternate choosing an element of the poset, removing it and all elements greater than it. The first player unable to select an element of the…

Computational Complexity · Computer Science 2015-03-20 Daniel Grier

Hex is a well known connection game in which two players attempt to connect opposite sides of the board by colored stones. In 2022, Hamkins and Leonessi introduced an infinite version, in which the goal is to construct a certain kind of…

Logic · Mathematics 2023-10-13 Ilkka Törmä

A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to obtain the outcome, which player has a winning strategy, of a given combinatorial game. Positions of…

Combinatorics · Mathematics 2025-11-27 Kengo Hashimoto

In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a…

Computer Science and Game Theory · Computer Science 2020-01-28 Guy Avni , Thomas A. Henzinger , Rasmus Ibsen-Jensen

In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…

Logic · Mathematics 2015-07-01 Stephane Le Roux

Relying on recent generalizations of the Fra\"iss\'e theory to a broader category-theoretic context, we study the class of abstract finite games played between two players and show the existence of an infinitetly countable game which is…

General Mathematics · Mathematics 2025-11-18 Matheus Duzi , Paul Szeptycki , Walter Tholen

This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…

Quantum Physics · Physics 2025-03-14 Theodore Andronikos

We identify a choiceless variation of the box game paradox, in which players predict unknown real numbers with near-perfect accuracy despite lacking any useful information. We also verify that choice is necessary in the solution of the…

Logic · Mathematics 2023-01-09 Elliot Glazer

We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games.

chao-dyn · Physics 2008-02-03 Karl Svozil

We study the existence of different notions of value in two-person zero-sum repeated games where the state evolves and players receive signals. We provide some examples showing that the limsup value (and the uniform value) may not exist in…

Optimization and Control · Mathematics 2016-01-08 Hugo Gimbert , Jérôme Renault , Sylvain Sorin , Xavier Venel , Wiesław Zielonka

This paper argues that the finite horizon paradox, where game theory contradicts intuition, stems from the limitations of standard number systems in modelling the cognitive perception of infinity. To address this issue, we propose a new…

Computer Science and Game Theory · Computer Science 2025-10-10 Kiri Sakahara , Takashi Sato

We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously;…

Computer Science and Game Theory · Computer Science 2012-01-04 Krishnendu Chatterjee