English
Related papers

Related papers: The epsilon-delta game and the chess

200 papers

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…

Computer Science and Game Theory · Computer Science 2017-04-04 Valerio Capraro , Marco Scarsini

We present a unifying representation of computation as a two-player game between an \emph{Algorithm} and \emph{Nature}, grounded in domain theory and game theory. The Algorithm produces progressively refined approximations within a Scott…

Computational Complexity · Computer Science 2025-11-04 Paul Alexander Bilokon

We consider zero-sum repeated games in which the players are restricted to strategies that require only a limited amount of randomness. Let $v_n$ be the max-min value of the $n$ stage game; previous works have characterized…

Computer Science and Game Theory · Computer Science 2019-02-12 Mehrdad Valizadeh , Amin Gohari

A large body of research is currently investigating on the connection between machine learning and game theory. In this work, game theory notions are injected into a preference learning framework. Specifically, a preference learning problem…

Machine Learning · Computer Science 2018-12-20 Mirko Polato , Fabio Aiolli

The Hausdorff $\delta$-dimension game was introduced by Das, Fishman, Simmons and {Urba{\'n}ski} and shown to characterize sets in $\mathbb{R}^d$ having Hausdorff dimension $\leq \delta$. We introduce a variation of this game which also…

Logic · Mathematics 2020-03-27 Logan Crone , Lior Fishman , Stephen Jackson

Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games were recently introduced as a way to define classes of games…

Logic in Computer Science · Computer Science 2020-01-22 Bastien Maubert , Aniello Murano , Sophie Pinchinat , François Schwarzentruber , Silvia Stranieri

This work studies the following question: can plays in a Muller game be stopped after a finite number of moves and a winner be declared. A criterion to do this is sound if Player 0 wins an infinite-duration Muller game if and only if she…

Computer Science and Game Theory · Computer Science 2010-06-09 John Fearnley , Martin Zimmermann

A working definition of the term \quantum game" is developed in an attempt to gain insights into aspects of quantum mechanics via game theory.

Quantum Physics · Physics 2011-06-16 Faisal Shah Khan , Simon. J. D. Phoenix

We study algorithmic complexity of solving subtraction games in a~fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algorithm solving the game runs in exponential time. Also we prove…

Computational Complexity · Computer Science 2020-01-14 Vladimir Gurvich , Michael Vyalyi

The Bell experiment is a random game with two binary outcomes whose statistical correlation is given by $E_0(\Theta)=-\cos(\Theta)$, where $\Theta \in [-\pi, \pi)$ is an angular input that parameterizes the game setting. The correlation…

Quantum Physics · Physics 2020-05-26 David H. Oaknin

With deeper study of the Game Theory, some conditions of Prisoner's Dilemma is no longer suitable of games in real life. So we try to develop a new model-Villager's Dilemma which has more realistic conditions to stimulate the process of…

Computer Science and Game Theory · Computer Science 2009-09-30 Beihang He

In an extended mean field game the vector field governing the flow of the population can be different from that of the individual player at some mean field equilibrium. This new class strictly includes the standard mean field games. It is…

Probability · Mathematics 2023-09-19 Chenchen Mou , Jianfeng Zhang

Sequences diverge either because they head off to infinity or because they oscillate. Part 1 constructs a non-Archimedean framework of infinite numbers that is large enough to contain asymptotic limit points for non-oscillating sequences…

General Mathematics · Mathematics 2011-08-26 David Alan Paterson

We show some chain-rules for the capacity of classical-quantum and quantum channels. We use the concept of Nash-Equilibrium in game-theory, and its existence in suitably defined games, to arrive at the chain-rules.

Quantum Physics · Physics 2020-12-01 Rahul Jain

This paper proposes a new approach to power in Game Theory. Cooperation and conflict are simulated with a mechanism of payoff alteration, called F-game. Using convex combinations of preferences, an F-game can measure players' attitude to…

Theoretical Economics · Economics 2024-01-30 Daniele De Luca

We present a new partial order reduction method for reachability analysis of nondeterministic labeled transition systems over metric spaces. Nondeterminism arises from both the choice of the initial state and the choice of actions, and the…

Logic in Computer Science · Computer Science 2018-05-14 Chuchu Fan , Zhenqi Huang , Sayan Mitra

In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…

Combinatorics · Mathematics 2019-09-12 Anna A. Taranenko

In this manuscript we define the notion of "$\delta$-typicality" for both entropy and relative entropy, as well as a notion of $\epsilon$-goodness and provide an extension to Stein's lemma for continuous quantities as well as correlated…

Information Theory · Computer Science 2025-02-17 Jihad Fahs , Ibrahim Abou Faycal , Ibrahim Issa

We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame-property. Using these games,…

Logic in Computer Science · Computer Science 2018-08-16 Philippe Balbiani , David Fernández-Duque , Andreas Herzig , Petar Iliev

We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…

Combinatorics · Mathematics 2024-10-10 Eddie Nijholt , Davide Sclosa