English
Related papers

Related papers: A game with divisors and absolute differences of e…

200 papers

We consider combining the definition of a cardinal invariant and the notion of an infinite game. We focus on the splitting number $\mathfrak{s}$ since the corresponding cardinal invariants behave in an interesting way. We introduce three…

In this paper, we study a game with positive or plus infinite expectation and determine the optimal proportion of investment for maximizing the limit expectation of growth rate per attempt. With this objective, we introduce a new pricing…

Optimization and Control · Mathematics 2013-06-28 Yukio Hirashita

We study an evolutionary game of chance in which the probabilities for different outcomes (e.g., heads or tails) depend on the amount wagered on those outcomes. The game is perhaps the simplest possible probabilistic game in which…

Physics and Society · Physics 2007-08-29 Dmitriy Cherkashin , J. Doyne Farmer , Seth Lloyd

We present detailed numerical results for a modified form of the so-called Minority Game, which provides a simplified model of a competitive market. Each agent has a limited set of strategies, and competes to be in a minority. An…

Condensed Matter · Physics 2009-10-31 T. S. Lo , S. W. Lim , P. M. Hui , N. F. Johnson

Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…

Logic in Computer Science · Computer Science 2014-05-01 Dietmar Berwanger , Anup Basil Mathew

We consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as…

Computer Science and Game Theory · Computer Science 2020-11-04 Bugra Caskurlu , Fatih Erdem Kizilkaya , Berkehan Ozen

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…

Computer Science and Game Theory · Computer Science 2010-04-26 Noah D. Stein , Asuman Ozdaglar , Pablo A. Parrilo

In the paper, there are new found methods to determine the range of every exceptional element in exceptional set, we can solve Twin primes problem and Goldbach Conjecture problem basically.

General Mathematics · Mathematics 2007-05-23 Goldtwe Anihc , Baishi Wang

We consider a setting in which a principal gets to choose which game from some given set is played by a group of agents. The principal would like to choose a game that favors one of the players, the social preferences of the players, or the…

Computer Science and Game Theory · Computer Science 2025-11-27 Caspar Oesterheld , Vincent Conitzer

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

In this paper I introduce a model which allows one to prove Goldbachs hypothesis. The model is produced by studying Goldbach partitions as displayed by an inverted mirror image of all the primes up to some even number equal to the last…

General Mathematics · Mathematics 2011-11-10 Kent Slinker

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…

Number Theory · Mathematics 2013-05-28 G. Everest , S. Stevens , D. Tamsett , T. Ward

We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate…

Combinatorics · Mathematics 2011-07-27 Will Johnson

A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning optimal outcomes were resolved. By generalizing standard game…

Computer Science and Game Theory · Computer Science 2023-10-31 Prem Kant , Urban Larsson , Ravi K. Rai , Akshay V. Upasany

A well-known conjecture of Gilbreath, and independently Proth from the 1800s, states that if $a_{0,n} = p_n$ denotes the $n^{\text{th}}$ prime number and $a_{i,n} = |a_{i-1,n}-a_{i-1,n+1}|$ for $i, n \ge 1$, then $a_{i,1} = 1$ for all $i…

Combinatorics · Mathematics 2022-01-12 Zachary Chase

Infinite games (in the form of Gale-Stewart games) are studied where a play is a sequence of natural numbers chosen by two players in alternation, the winning condition being a subset of the Baire space $\omega^\omega$. We consider such…

Computer Science and Game Theory · Computer Science 2023-06-22 Benedikt Brütsch , Wolfgang Thomas

We demonstrate that parallel repetition of the multiplayer anchored optimal value, $\omega \big( G_{\bot} \big)^{\otimes n}$, decays exponentially. Central to our approach are several probabilistic computations, pertaining to: (1) the…

Quantum Physics · Physics 2025-08-14 Pete Rigas

Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…

Computer Science and Game Theory · Computer Science 2010-04-30 Pierre Lescanne , Perrinel Matthieu

Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…

Computer Science and Game Theory · Computer Science 2011-12-16 Pierre Lescanne , Perrinel Matthieu

We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…

Computational Complexity · Computer Science 2012-02-06 Urban Larsson , Johan Wästlund
‹ Prev 1 8 9 10 Next ›