English
Related papers

Related papers: Hydra games for recursively Mahlo operations

200 papers

Game theory has been widely applied to many areas including economics, biology and social sciences. However, it is still challenging to quantify the global stability and global dynamics of the game theory. We developed a landscape and flux…

Populations and Evolution · Quantitative Biology 2018-09-05 Li Xu , Jin Wang

Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is…

Logic in Computer Science · Computer Science 2014-08-27 Ilaria De Crescenzo , Salvatore La Torre , Yaron Velner

In the paper "Confinement of matroid representations to subsets of partial fields" (arXiv:0806.4487) we introduced the Hydra-k partial fields to study quinary matroids with inequivalent representations. The proofs of some results on these…

Combinatorics · Mathematics 2010-03-09 R. A. Pendavingh , S. H. M. van Zwam

Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…

Dynamical Systems · Mathematics 2024-10-28 Hongjia H. Chen , Hinke M. Osinga

In 2013, Kharlampovich, Myasnikov, and Sapir constructed the first examples of finitely presented residually finite groups with large Dehn functions. Given any recursive function $f$, they produce a finitely presented residually finite…

Group Theory · Mathematics 2015-07-31 Kristen Pueschel

In a game of permutation wordle, a player attempts to guess a secret permutation in the fewest number of guesses possible. Previously, Samuel Kutin and Lawren Smithline (arXiv:2408.00903) introduced this game and proposed a strategy called…

Combinatorics · Mathematics 2026-01-12 Aurora Hiveley

Mancala is a generic name for a family of sowing games that are popular all over the world. There are many two-player mancala games in which a player may move again if their move ends in their own store. In this work, we study a simple…

Combinatorics · Mathematics 2011-12-16 Brant Jones , Laura Taalman , Anthony Tongen

The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided…

Computer Science and Game Theory · Computer Science 2013-12-30 Fedor Sandomirskiy

A simple model for cooperation between "selfish" agents, which play an extended version of the Prisoner's Dilemma(PD) game, in which they use arbitrary payoffs, is presented and studied. A continuous variable, representing the probability…

Condensed Matter · Physics 2009-11-10 H. Fort

We present a scheme for playing quantum repeated 2x2 games based on the Marinatto and Weber's approach to quantum games. As a potential application, we study twice repeated Prisoner's Dilemma game. We show that results not available in…

Quantum Physics · Physics 2015-05-30 Piotr Frackiewicz

The focus of this essay is a rigorous treatment of infinite games. An infinite game is defined as a play consisting of a fixed number of players whose sequence of moves is repeated, or iterated ad infinitum. Each sequence corresponds to a…

Category Theory · Mathematics 2010-01-12 Thomas Kellam Meyer

Game theory is the standard tool used to model strategic interactions in evolutionary biology and social science. Traditional game theory studies the equilibria of simple games. But is traditional game theory applicable if the game is…

Chaotic Dynamics · Physics 2011-09-22 Tobias Galla , J. Doyne Farmer

In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always…

Computer Science and Game Theory · Computer Science 2012-09-17 Yaron Velner , Krishnendu Chatterjee , Laurent Doyen , Thomas A. Henzinger , Alexander Rabinovich , Jean-Francois Raskin

In this paper, the existence of non-trivial time periodic solutions of first order mean field games is proved. It is assumed that there is a non-trivial periodic orbit contained in the Mather set. The whole system is autonomous with a…

Analysis of PDEs · Mathematics 2024-01-17 Panrui Ni

The theory of repeated games analyzes the long-term relationship of interacting players and mathematically reveals the condition of how cooperation is achieved, which is not achieved in a one-shot game. In the repeated prisoner's dilemma…

Populations and Evolution · Quantitative Biology 2019-06-20 Azumi Mamiya , Genki Ichinose

Game semantics and winning strategies offer a potential conceptual bridge between semantics and proof systems of logics. We illustrate this link for hybrid logic -- an extension of modal logic that allows for explicit reference to worlds…

Logic in Computer Science · Computer Science 2022-06-02 Robert Freiman

We consider the problem of a particular kind of quantum correlation that arises in some two-party games. In these games, one player is presented with a question they must answer, yielding an outcome of either 'win' or 'lose'. Molina and…

Quantum Physics · Physics 2017-03-14 Srinivasan Arunachalam , Abel Molina , Vincent Russo

Here, we observe that mean-field game (MFG) systems admit a two-player infinite-dimensional general-sum differential game formulation. We show that particular regimes of this game reduce to previously known variational principles.…

Analysis of PDEs · Mathematics 2018-04-25 Marco Cirant , Levon Nurbekyan

In this paper, we introduce a family of games called concave pro-rata games. In such a game, players place their assets into a pool, and the pool pays out some concave function of all assets placed into it. Each player then receives a…

Computer Science and Game Theory · Computer Science 2023-02-07 Nicholas A. G Johnson , Theo Diamandis , Alex Evans , Henry de Valence , Guillermo Angeris

This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main motivation for studying these games comes from the connections…

Formal Languages and Automata Theory · Computer Science 2020-10-14 Christopher H. Broadbent , Arnaud Carayol , Matthew Hague , Andrzej S. Murawski , C. -H. Luke Ong , Olivier Serre