English
Related papers

Related papers: Relator Games on Groups

200 papers

Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…

Combinatorics · Mathematics 2021-01-29 Urban Larsson , Richard J. Nowakowski , Carlos P. Santos

A group obtained from a nontrivial group by adding one generator and one relator which is a proper power of a word in which the exponent-sum of the additional generator is one contains the free square of the initial group and almost always…

Group Theory · Mathematics 2015-03-17 Anton A. Klyachko , Denis E. Lurye

We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend…

General Finance · Quantitative Finance 2009-02-09 Dmitriy Cherkashin , J. Doyne Farmer , Seth Lloyd

Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the model and study the underlying games as well as possible…

Computer Science and Game Theory · Computer Science 2025-10-07 Martin Černý , Jan Bok , David Hartman , Milan Hladík

We unify standard frameworks for approachability both in full or partial monitoring by defining a new abstract game, called the "purely informative game", where the outcome at each stage is the maximal information players can obtain,…

Computer Science and Game Theory · Computer Science 2013-01-17 Vianney Perchet , Marc Quincampoix

Many learning algorithms are known to converge to an equilibrium for specific classes of games if the same learning algorithm is adopted by all agents. However, when the agents are self-interested, a natural question is whether agents have…

Computer Science and Game Theory · Computer Science 2024-02-15 Shivam Bajaj , Pranoy Das , Yevgeniy Vorobeychik , Vijay Gupta

We introduce two-player games which build words over infinite alphabets, and we study the problem of checking the existence of winning strategies. These games are played by two players, who take turns in choosing valuations for variables…

Logic in Computer Science · Computer Science 2023-06-22 Diego Figueira , Anirban Majumdar , M. Praveen

Given an increasing graph property $\cal F$, the strong Avoider-Avoider $\cal F$ game is played on the edge set of a complete graph. Two players, Red and Blue, take turns in claiming previously unclaimed edges with Red going first, and the…

Computer Science and Game Theory · Computer Science 2025-05-30 Miloš Stojaković , Jelena Stratijev

We study multi-player games with perfect information and general payoff function, where the set of stages is the set of non-positive integers $\{\ldots,-2,-1,0\}$. We define two related equilibrium concepts: one considering only deviations…

Optimization and Control · Mathematics 2025-12-02 Galit Ashkenazi-Golan , János Flesch , Eilon Solan

Game theoretic equilibria are mathematical expressions of rationality. Rational agents are used to model not only humans and their software representatives, but also organisms, populations, species and genes, interacting with each other and…

Computer Science and Game Theory · Computer Science 2015-05-13 Dusko Pavlovic

Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…

Combinatorics · Mathematics 2012-06-29 Derrick Stolee

In this thesis we introduce quantum refereed games, which are quantum interactive proof systems with two competing provers. We focus on a restriction of this model that we call "short quantum games" and we prove an upper bound and a lower…

Computational Complexity · Computer Science 2007-05-23 Gus Gutoski

We propose a two-agent game wherein a questioner must be able to conjure discerning questions between sentences, incorporate responses from an answerer, and keep track of a hypothesis state. The questioner must be able to understand the…

Computation and Language · Computer Science 2019-08-14 Peter Potash , Kaheer Suleman

In this paper, we consider $\mathcal{L}\mathcal{R}$-ending partisan rulesets as a branch of combinatorial game theory. In these rulesets, the sets of options of both players are the same. However, there are two kinds of terminal positions.…

Combinatorics · Mathematics 2025-11-19 Hiroki Inazu , Shun-ichi Kimura , Koki Suetsugu

Different classes of automata on infinite words have different expressive power. Deciding whether a given language $L \subseteq \Sigma^\omega$ can be expressed by an automaton of a desired class can be reduced to deciding a game between…

Formal Languages and Automata Theory · Computer Science 2022-01-26 Orna Kupferman , Salomon Sickert

To align conditional text generation model outputs with desired behaviors, there has been an increasing focus on training the model using reinforcement learning (RL) with reward functions learned from human annotations. Under this…

Computation and Language · Computer Science 2023-06-02 Richard Yuanzhe Pang , Vishakh Padmakumar , Thibault Sellam , Ankur P. Parikh , He He

The class of Guaranteed Scoring Games (GS) are two-player combinatorial games with the property that Normal-play games (Conway et. al.) are ordered embedded into GS. They include, as subclasses, the scoring games considered by Milnor…

Combinatorics · Mathematics 2015-06-01 Urban Larsson , João P. Neto , Richard J. Nowakowski , Carlos P. Santos

Can we predict how well a team of individuals will perform together? How should individuals be rewarded for their contributions to the team performance? Cooperative game theory gives us a powerful set of tools for answering these questions:…

Machine Learning · Computer Science 2020-06-18 Tom Yan , Christian Kroer , Alexander Peysakhovich

Two-player zero-sum games of infinite duration and their quantitative versions are used in verification to model the interaction between a controller (Eve) and its environment (Adam). The question usually addressed is that of the existence…

Computer Science and Game Theory · Computer Science 2021-10-29 Paul Hunter , Guillermo A. Pérez , Jean-François Raskin

Iterated games are a fundamental component of economic and evolutionary game theory. They describe situations where two players interact repeatedly and have the possibility to use conditional strategies that depend on the outcome of…

Populations and Evolution · Quantitative Biology 2015-06-12 Christian Hilbe , Martin A. Nowak , Karl Sigmund