English
Related papers

Related papers: A brief conversation about subtraction games

200 papers

Entropy games and matrix multiplication games have been recently introduced by Asarin et al. They model the situation in which one player (Despot) wishes to minimize the growth rate of a matrix product, whereas the other player (Tribune)…

Computer Science and Game Theory · Computer Science 2019-12-30 Marianne Akian , Stéphane Gaubert , Julien Grand-Clément , Jérémie Guillaud

For some well-known games, such as the Traveler's Dilemma or the Centipede Game, traditional game-theoretic solution concepts--and most notably Nash equilibrium--predict outcomes that are not consistent with empirical observations. In this…

Computer Science and Game Theory · Computer Science 2008-10-20 Joseph Y. Halpern , Rafael Pass

We establish a theoretical framework to address evolutionary dynamics of spatial games under strong selection. As the selection intensity tends to infinity, strategy competition unfolds in the deterministic way of winners taking all. We…

Populations and Evolution · Quantitative Biology 2022-09-20 Te Wu , Feng Fu , Long Wang

In this paper, we develop a Mean Field Games approach to Cluster Analysis. We consider a finite mixture model, given by a convex combination of probability density functions, to describe the given data set. We interpret a data point as an…

Numerical Analysis · Mathematics 2019-12-24 Laura Aquilanti , Simone Cacace , Fabio Camilli , Raul De Maio

Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the controller, while the other describes the (adversarial) environment, and…

Computer Science and Game Theory · Computer Science 2010-06-04 Marta Kwiatkowska , Gethin Norman , Ashutosh Trivedi

This paper investigates the discrete-time asynchronous games in which noncooperative agents seek to minimize their individual cost functions. Building on the assumption of partial asynchronism, i.e., each agent updates at least once within…

Optimization and Control · Mathematics 2025-08-13 Zifan Wang , Xinlei Yi , Michael M. Zavlanos , Karl H. Johansson

Merging asymptotic expansions of arbitrary length are established for the distribution functions and for the probabilities of suitably centered and normalized cumulative winnings in a full sequence of generalized St. Petersburg games,…

Probability · Mathematics 2009-10-26 Gyula Pap

In an investigation of the applications of Combinatorial Game Theory to chess, we construct novel mutual Zugzwang positions, explain an otherwise mysterious pawn endgame from "A Guide to Chess Endings" (Euwe and Hooper), show positions…

Combinatorics · Mathematics 2007-05-23 Noam D. Elkies

This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…

Optimization and Control · Mathematics 2016-05-17 Monica Patriche

Prisoner's Dilemma (PD) is a widely studied game that plays an important role in Game Theory. This paper aims at extending PD Tournaments to the case of infinite, finite or infinitesimal payoffs using Sergeyev's Infinity Computing (IC). By…

Computer Science and Game Theory · Computer Science 2020-02-18 Lorenzo Fiaschi , Marco Cococcioni

This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main…

Computer Science and Game Theory · Computer Science 2017-07-10 Josep Freixas , Marc Freixas , Sascha Kurz

Empirical game-theoretic analysis (EGTA) is primarily focused on learning the equilibria of simulation-based games. Recent approaches have tackled this problem by learning a uniform approximation of the game's utilities, and then applying…

Computer Science and Game Theory · Computer Science 2022-08-15 Cyrus Cousins , Bhaskar Mishra , Enrique Areyan Viqueira , Amy Greenwald

Monte-Carlo counterfactual regret minimization (MCCFR) is the state-of-the-art algorithm for solving sequential games that are too large for full tree traversals. It works by using gradient estimates that can be computed via sampling.…

Computer Science and Game Theory · Computer Science 2020-02-21 Gabriele Farina , Christian Kroer , Tuomas Sandholm

We propose a unifying additive theory for standard conventions in Combinatorial Game Theory, including normal-, mis\`ere- and scoring-play, studied by Berlekamp, Conway, Dorbec, Ettinger, Guy, Larsson, Milley, Neto, Nowakowski, Renault,…

Combinatorics · Mathematics 2021-07-07 Urban Larsson , Richard J. Nowakowski , Carlos P. Santos

The paper investigates the long-time behavior of zero-sum linear-quadratic stochastic differential games, aiming to demonstrate that, under appropriate conditions, both the saddle strategy and the optimal state process exhibit the…

Optimization and Control · Mathematics 2024-06-05 Jingrui Sun , Jiongmin Yong

In this paper, we consider $\mathcal{L}\mathcal{R}$-ending partisan rulesets as a branch of combinatorial game theory. In these rulesets, the sets of options of both players are the same. However, there are two kinds of terminal positions.…

Combinatorics · Mathematics 2025-11-19 Hiroki Inazu , Shun-ichi Kimura , Koki Suetsugu

We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…

Logic · Mathematics 2024-01-24 Arno Pauly , Giovanni Soldà

Various decomposition of finite games have been proposed. The inner product of vectors plays a key role in the decomposition of finite games. This paper considers the effect of different inner products on the orthogonal decomposition of…

Optimization and Control · Mathematics 2019-05-21 Changxi Li , Daizhan Cheng , Fenghua He

The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the follower) plays a best response to this strategy (ties are broken…

Computer Science and Game Theory · Computer Science 2016-08-24 Branislav Bosansky , Simina Branzei , Kristoffer Arnsfelt Hansen , Peter Bro Miltersen , Troels Bjerre Sorensen

In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these…

Computer Science and Game Theory · Computer Science 2016-03-31 Argyrios Deligkas , John Fearnley , Paul Spirakis
‹ Prev 1 8 9 10 Next ›