English
Related papers

Related papers: The epsilon-delta game and the chess

200 papers

We relate the amount of entanglement required to play linear-system non-local games near-optimally to the hyperlinear profile of finitely-presented groups. By calculating the hyperlinear profile of a certain group, we give an example of a…

Quantum Physics · Physics 2018-10-17 William Slofstra , Thomas Vidick

We provide a deterministic-control-based interpretation for a broad class of fully nonlinear parabolic and elliptic PDEs with continuous Neumann boundary conditions in a smooth domain. We construct families of two-person games depending on…

Analysis of PDEs · Mathematics 2013-11-14 Jean-Paul Daniel

The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and…

Logic · Mathematics 2022-01-31 Richard Zach

Infinitely repeated games support equilibrium concepts beyond those present in one-shot games (e.g., cooperation in the prisoner's dilemma). Nonetheless, repeated games fail to capture our real-world intuition for settings with many…

Computer Science and Game Theory · Computer Science 2025-05-22 Henry Fleischmann , Kiriaki Fragkia , Ratip Emin Berker

The game of chess is well-known and widely played all over the world. However, the rules for playing it are rather complex since there are different types of pieces and the ways they are allowed to move depend upon the type of the piece. In…

Programming Languages · Computer Science 2023-03-21 Morten Haahr Kristensen , Peter Gorm Larsen

In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal…

Computer Science and Game Theory · Computer Science 2013-03-08 Michael Johanson

Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class $\mathcal{C}_\alpha$…

Combinatorics · Mathematics 2012-11-20 Josep Freixas , Sascha Kurz

Notes on the Spinpossible puzzle game. We give a mathematical description of the game, prove some elementary bounds on the length of optimal solutions, and consider variations of the game which place restrictions on the set of permitted…

Combinatorics · Mathematics 2011-11-01 Alex Sutherland , Andrew Sutherland

Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the preferences of all the voters in a typical prediction scenario, a…

Data Structures and Algorithms · Computer Science 2016-04-21 Arnab Bhattacharyya , Palash Dey

We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown…

Computer Science and Game Theory · Computer Science 2012-10-10 Wladimir Fridman , Martin Zimmermann

Finite objects and more specifically finite games are formalized using induction, whereas infinite objects are formalized using coinduction. In this article, after an introduction to the concept of coinduction, we revisit on infinite…

Computer Science and Game Theory · Computer Science 2009-04-28 Pierre Lescanne

This is a short introduction to the subject of strategic games. We focus on the concepts of best response, Nash equilibrium, strict and weak dominance, and mixed strategies, and study the relation between these concepts in the context of…

Computer Science and Game Theory · Computer Science 2011-02-02 Krzysztof R. Apt

In this paper, we present a new development of inspection games in a mean field setting. In our dynamic version of an inspection game, there is one inspector and a large number N interacting inspectees with a finite state space. By applying…

Optimization and Control · Mathematics 2015-07-31 Vassili Kolokoltsov , Wei Yang

People, robots, and companies mostly divide time and effort among projects, and \defined{shared effort games} model people investing resources in public endeavors and sharing the generated values. In linear $\theta$ sharing (effort) games,…

Computer Science and Game Theory · Computer Science 2026-05-26 Gleb Polevoy , Stojan Trajanovski , Mathijs de Weerdt

In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time.…

Computer Science and Game Theory · Computer Science 2015-04-29 Xinyun Liu , Jiandong Zhu

We investigate the existence of certain types of equilibria (Nash, $\varepsilon$-Nash, subgame perfect, $\varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental…

Logic in Computer Science · Computer Science 2016-03-18 Stéphane Le Roux , Arno Pauly

Modern applications require robots to comply with multiple, often conflicting rules and to interact with the other agents. We present Posetal Games as a class of games in which each player expresses a preference over the outcomes via a…

Although synergy is an important concept that is strongly ingrained in games, it has not been widely discussed by the games community. This is due to the vagueness of the concept and the fact that there is no clear agreement on what it…

Computer Science and Game Theory · Computer Science 2025-02-17 Joshua Kritz , Raluca Gaina

We consider $\epsilon$-equilibria notions for constant value of $\epsilon$ in $n$-player $m$-actions games where $m$ is a constant. We focus on the following question: What is the largest grid size over the mixed strategies such that…

Computer Science and Game Theory · Computer Science 2017-01-30 Itai Arieli , Yakov Babichenko

A concept of "guessability" is defined for sets of sequences of naturals. Eventually, these sets are thoroughly characterized. To do this, a nonstandard logic is developed, a logic containing symbols for the ellipsis as well as for…

Logic · Mathematics 2012-01-25 Samuel Alexander