English
Related papers

Related papers: Constructive comparison in bidding combinatorial g…

200 papers

We show how two techniques from statistical physics can be adapted to solve a variant of the notorious Unique Games problem, potentially opening new avenues towards the Unique Games Conjecture. The variant, which we call Count Unique Games,…

Data Structures and Algorithms · Computer Science 2021-03-05 Matthew Coulson , Ewan Davies , Alexandra Kolla , Viresh Patel , Guus Regts

We provide an epistemic analysis of arbitrary strategic games based on possibility correspondences. We first establish a generic result that links true common beliefs (and, respectively, common knowledge) of players' rationality defined by…

Computer Science and Game Theory · Computer Science 2008-11-07 Krzysztof R. Apt , Jonathan A. Zvesper

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

We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…

Computer Science and Game Theory · Computer Science 2016-02-25 Kai Jin , Pingzhong Tang , Shiteng Chen

A combinatorial game is a two-player game without hidden information or chance elements. One of the major approaches to analyzing games in combinatorial game theory is to break down a given game position into a disjunctive sum of multiple…

Combinatorics · Mathematics 2024-11-14 Kengo Hashimoto

The aim of this paper is twofold. First, we extend the results of [33] concerning the existence and uniqueness of second-order reflected 2BSDEs to the case of two obstacles. Under some regularity assumptions on one of the barriers, similar…

Probability · Mathematics 2014-01-31 Anis Matoussi , Lambert Piozin , Dylan Possamaï

Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…

Computer Science and Game Theory · Computer Science 2020-04-01 Joseph Abdou , Nikolaos Pnevmatikos , Marco Scarsini , Xavier Venel

An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…

Logic · Mathematics 2024-08-28 Tonatiuh Matos-Wiederhold , Luciano Salvetti

This is an introduction into John Conway's beautiful Combinatorial Game Theory, providing precise statements and detailed proofs for the fundamental parts of his theory. (1) Combinatorial game theory, (2) the GROUP of games, (3) the FIELD…

Combinatorics · Mathematics 2007-08-21 Dierk Schleicher , Michael Stoll

Recent literature on online learning has focused on developing adaptive algorithms that take advantage of a regularity of the sequence of observations, yet retain worst-case performance guarantees. A complementary direction is to develop…

Machine Learning · Computer Science 2015-01-27 Ali Jadbabaie , Alexander Rakhlin , Shahin Shahrampour , Karthik Sridharan

The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…

Quantum Physics · Physics 2007-05-23 Andrey Grib , Georges Parfionov

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

This paper establishes a novel combinatorial framework at the intersection of Lie theory and algebraic combinatorics, based on a generalization of the Kostant game. We begin by reviewing the foundations of root systems, the classification…

Combinatorics · Mathematics 2026-02-06 Juan Sebastián Cortés-Cruz

We characterize the optimal reward functions (scoring rules) that incentivize an agent to acquire information and report it truthfully to the principal. The optimal scoring rules let the agent make a simple binary bet in single-dimensional…

Computer Science and Game Theory · Computer Science 2025-10-03 Jason D. Hartline , Yingkai Li , Liren Shan , Yifan Wu

We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show…

Computer Science and Game Theory · Computer Science 2013-01-25 Peter Duersch , Joerg Oechssler , Burkhard C. Schipper

Mutual imitation games among artificial birds are studied. By employing a variety of mappings and game rules, the evolution to the edge between chaos and windows is universally confirmed. Some other general features are observed, including…

adap-org · Physics 2008-02-03 Kunihiko Kaneko , Junji Suzuki

We characterize the class of symmetric two-player games in which tit-for-tat cannot be beaten even by very sophisticated opponents in a repeated game. It turns out to be the class of exact potential games. More generally, there is a class…

Computer Science and Game Theory · Computer Science 2013-01-25 Peter Duersch , Joerg Oechssler , Burkhard C. Schipper

A recently introduced concept of "cooperative equilibrium", based on the assumption that players have a natural attitude to cooperation, has been proven a powerful tool in predicting human behaviour in social dilemmas. In this paper, we…

Computer Science and Game Theory · Computer Science 2015-09-28 Valerio Capraro , Maria Polukarov , Matteo Venanzi , Nicholas R. Jennings

We introduce a solution concept for extensive-form games of incomplete information in which players need not assign likelihoods to what they do not know about the game. This is embedded in a model in which players can hold multiple priors.…

Theoretical Economics · Economics 2021-09-03 Karl Schlag , Andriy Zapechelnyuk

We propose a continuous version of the classical Gale--Berlekamp switching game. We also study a weighted version of this new continuous game. The main results of this paper concern growth estimates for the corresponding optimization…

Combinatorics · Mathematics 2020-03-16 Daniel Pellegrino , Janiely Silva , Eduardo V. Teixeira