English
Related papers

Related papers: Variance decompositions for extensive-form games

200 papers

We introduce a simple one-parameter game derived from a model describing the properties of a directed polymer in a random medium. At his turn, each of the two players picks a move among two alternatives in order to maximize his final score,…

Statistical Mechanics · Physics 2008-12-08 Clément Sire

We introduce a refinement of the usual Ehrenfeucht-Fra\"{\i}ss\'e game. The new game will help us make finer distinctions than the traditional one. In particular, it can be used to measure the size formulas needed for expressing a given…

Logic · Mathematics 2012-08-24 Lauri Hella , Jouko Väänänen

We introduce a two-player game, in which each player extends a given sequence by picking a free element in a domain D of the real line. The aim of the players is to control the parity of the number of transpositions necessary to put the…

Combinatorics · Mathematics 2009-04-06 Elise Janvresse , Steve Kalikow , Thierry De La Rue

Modern chess engines significantly outperform human players and are essential for evaluating positions and move quality. These engines assign a numerical evaluation $E$ to positions, indicating an advantage for either white or black, but…

Physics and Society · Physics 2025-05-07 Marc Barthelemy

We introduce a new type of game on natural numbers of variable countable length, which can be regarded as a diagonalization of all games of fixed countable length on natural numbers. Building on previous work by Trang and Woodin, we show…

Logic · Mathematics 2026-01-08 Takehiko Gappo , Sandra Müller

In many areas of engineering and sciences, decision rules and control strategies are usually designed based on nominal values of relevant system parameters. To ensure that a control strategy or decision rule will work properly when the…

Probability · Mathematics 2020-06-16 Xinjia Chen

Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners of a subset of nodes. We investigate here how effective…

Logic in Computer Science · Computer Science 2016-09-15 Patrick Ah-Fat , Michael Huth

Inspired by the theory of desirable gambles that is used to model uncertainty in the field of imprecise probabilities, I present a theory of desirable things. Its aim is to model a subject's beliefs about which things are desirable. What…

Artificial Intelligence · Computer Science 2023-05-12 Jasper De Bock

We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…

Logic · Mathematics 2011-12-01 Luca Motto Ros

Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…

Logic · Mathematics 2019-02-20 Lior Fishman , Tue Ly , David S. Simmons

We develop a mathematical formalism that allows to study decoherence with a great level generality, so as to make it appear as a geometrical phenomenon between reservoirs of dimensions. It enables us to give quantitative estimates of the…

Mathematical Physics · Physics 2024-01-30 Antoine Soulas

Dimensionality reduction is ubiquitous in analysis of complex dynamics. The conventional dimensionality reduction techniques, however, focus on reproducing the underlying configuration space, rather than the dynamics itself. The constructed…

Data Analysis, Statistics and Probability · Physics 2013-05-29 Sergei V. Krivov

We study the computational complexity of the popular board game backgammon. We show that deciding whether a player can win from a given board configuration is NP-Hard, PSPACE-Hard, and EXPTIME-Hard under different settings of known and…

Computational Complexity · Computer Science 2021-12-15 R. Teal Witter

This paper analyzes a simple game with $n$ players. We fix a mean, $\mu$, in the interval $[0, 1]$ and let each player choose any random variable distributed on that interval with the given mean. The winner of the zero-sum game is the…

Probability · Mathematics 2018-04-24 Artem Hulko , Mark Whitmeyer

Contemporary statistical publications rely on simulation to evaluate performance of new methods and compare them with established methods. In the context of meta-analysis of log-odds-ratios, we investigate how the ways in which simulations…

Methodology · Statistics 2020-07-06 Elena Kulinskaya , David C. Hoaglin , Ilyas Bakbergenuly

Randomness is a central concept to statistics and physics. Here, a statistical analysis shows experimental evidence that tossing coins and finding last digits of prime numbers are identical regarding statistics for equally likely outcomes.…

Applications · Statistics 2019-10-29 Yeseul Kim , Byung Mook Weon

We elicit incomplete preferences over monetary gambles with subjective uncertainty. Subjects rank gambles, and these rankings are used to estimate preferences; payments are based on estimated preferences. About 40\% of subjects express…

General Economics · Economics 2022-10-06 Kirby Nielsen , Luca Rigotti

Players (people, firms, states, etc.) have privacy concerns that may affect their choice of actions in strategic settings. We use a variant of signaling games to model this effect and study its relation to pooling behavior,…

Computer Science and Game Theory · Computer Science 2017-05-18 Ronen Gradwohl , Rann Smorodinsky

The game of war is one of the most popular international children's card games. In the beginning of the game, the pack is split into two parts, then on each move the players reveal their top cards. The player having the highest card…

Dynamical Systems · Mathematics 2012-04-05 Evgeny Lakshtanov , Vera Roshchina

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