English
Related papers

Related papers: Ten times eighteen

200 papers

Every simple game is a monotone Boolean function. For the other direction we just have to exclude the two constant functions. The enumeration of monotone Boolean functions with distinguishable variables is also known as the Dedekind's…

Combinatorics · Mathematics 2025-02-03 Sascha Kurz , Dani Samaniego

Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate…

Disordered Systems and Neural Networks · Physics 2009-10-31 Johannes Berg

We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an…

Shortest-path games are two-player zero-sum games played on a graph equipped with integer weights. One player, that we call Min, wants to reach a target set of states while minimising the total weight, and the other one has an antagonistic…

Computer Science and Game Theory · Computer Science 2021-05-04 Benjamin Monmege , Julie Parreaux , Pierre-Alain Reynier

We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…

Computer Science and Game Theory · Computer Science 2016-02-25 Kai Jin , Pingzhong Tang , Shiteng Chen

A casino offers the following game. There are three cups each containing a die. You are being told that the dice in the cups are all the same, but possibly nonstandard. For a bet of \$1, the game master shakes all three cups and lets you…

Probability · Mathematics 2025-09-16 Pierre C Bellec , Tobias Fritz

A common format for sports contests involves pairwise matches between two teams, with the #1 player of team A matched against the #1 player of team B, the #2 player of team A against the #2 player of team B, and so on. This paper addresses…

History and Overview · Mathematics 2014-04-07 Dana Mackenzie

In this work the properties of multi choice minority games are studied by means of extensive computational simulations. We have considered several ways of rewarding the strategies of the players and compared the resulting behaviours of the…

Disordered Systems and Neural Networks · Physics 2008-11-23 J. Menche , J. R. L. de Almeida

This paper revisits a classical problem of slotted multiple access with success, idle, and collision events on each slot. First, results of a 2-user multiple access game are reported. The game was conducted at the University of Southern…

Computer Science and Game Theory · Computer Science 2021-12-24 Michael J. Neely

This paper considers information sharing in a multi-player repeated game. Every round, each player observes a subset of components of a random vector and then takes a control action. The utility earned by each player depends on the full…

Optimization and Control · Mathematics 2014-12-31 Michael J. Neely

Game theory has been increasingly applied in settings where the game is not known outright, but has to be estimated by sampling. For example, meta-games that arise in multi-agent evaluation can only be accessed by running a succession of…

Multiagent Systems · Computer Science 2021-01-25 Tabish Rashid , Cheng Zhang , Kamil Ciosek

The game of Hex has two players who take turns placing stones of their respective colors on the hexagons of a rhombus-shaped hexagonal grid. Black wins by completing a crossing between two opposite edges, while White wins by completing a…

Probability · Mathematics 2009-02-25 Yuval Peres , Oded Schramm , Scott Sheffield , David B. Wilson

Gimbert and Horn gave an algorithm for solving simple stochastic games with running time O(r! n) where n is the number of positions of the simple stochastic game and r is the number of its coin toss positions. Chatterjee et al. pointed out…

Computer Science and Game Theory · Computer Science 2012-03-21 Rasmus Ibsen-Jensen , Peter Bro Miltersen

In imperfect information games, the evaluation of a game state not only depends on the observable world but also relies on hidden parts of the environment. As accessing the obstructed information trivialises state evaluations, one approach…

Artificial Intelligence · Computer Science 2024-07-15 Timo Bertram , Johannes Fürnkranz , Martin Müller

Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts and crosses) board game. Two players compete to win three aligned "fields", each of them being a tic-tac-toe game. Each move determines which field the next player…

Computer Science and Game Theory · Computer Science 2020-06-09 Guillaume Bertholon , Rémi Géraud-Stewart , Axel Kugelmann , Théo Lenoir , David Naccache

We study the inverse power index problem for weighted voting games: the problem of finding a weighted voting game in which the power of the players is as close as possible to a certain target distribution. Our goal is to find algorithms…

Computer Science and Game Theory · Computer Science 2013-07-02 Bart de Keijzer , Tomas B. Klos , Yingqian Zhang

We study a game where one player selects a random function, and the other has to guess that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to…

Optimization and Control · Mathematics 2023-11-28 Catherine Rainer , Eilon Solan

Game theory is the study of tractable games which may be used to model more complex systems. Board games, video games and sports, however, are intractable by design, so "ludological" theories about these games as complex phenomena should be…

Applications · Statistics 2018-11-05 Daniel E. Gilbert , Martin T. Wells

Risk is a well-known turn based board game where the primary objective is nothing less than the world domination. Gameplay is based on battles between armies located in adjacent territories on the map of Earth. The combat's outcome is…

Computer Science and Game Theory · Computer Science 2012-04-19 Manu Harju

Let $V$ be a multiset of $n$ points in $\mathbb{R}^d$, which we call voters, and let $k\geq 1$ and $\ell\geq 1$ be two given constants. We consider the following game, where two players $\mathcal{P}$ and $\mathcal{Q}$ compete over the…

Computational Geometry · Computer Science 2019-02-26 Mark de Berg , Sándor Kisfaludi-Bak , Mehran Mehr