English
Related papers

Related papers: High Temperature Domineering Positions

200 papers

"Dominos" are special entities consisting of a hard dimer-like kernel surrounded by a soft hull and governed by local interactions. "Soft hull" and "hard kernel" mean that the hulls can overlap while the kernel acts under a repulsive…

Combinatorics · Mathematics 2023-05-09 Dominique Désérable , Rolf Hoffmann , Franciszek Seredyński

Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. We consider delay games with winning conditions expressed in weak monadic second order logic with…

Computer Science and Game Theory · Computer Science 2015-09-25 Martin Zimmermann

We define a variant of the two-dimensional Silver Dollar game. Two coins are placed on a chessboard of unbounded size, and two players take turns choosing one of the coins and moving it. Coins are to be moved to the left or upward…

General Mathematics · Mathematics 2025-06-10 Ryohei Miyadera , Enchong Li , Akito Tsujii

The iterated prisoner's dilemma is a game that produces many counter-intuitive and complex behaviors in a social environment, based on very simple basic rules. It illustrates that cooperation can be a good thing even in a competitive world,…

Computer Science and Game Theory · Computer Science 2020-09-07 Robert Prentner

Multiferroic materials, in which ferroelectric and magnetic ordering coexist, are of fundamental interest for the development of multi-state memory devices that allow for electrical writing and non-destructive magnetic read-out operation.…

Materials Science · Physics 2013-09-03 Xavier Rocquefelte , Karlheinz Schwarz , Peter Blaha , Sanjeev Kumar , Jeroen van den Brink

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

The localization game is played by two players: a Cop with a team of $k$ cops, and a Robber. The game is initialised by the Robber choosing a vertex $r \in V$, unknown to the Cop. Thereafter, the game proceeds turn based. At the start of…

Combinatorics · Mathematics 2020-10-16 Jeandré Boshoff , Adriana Roux

In the total domination game played on a graph $G$, players Dominator and Staller alternately select vertices of $G$, as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller)…

Combinatorics · Mathematics 2017-09-19 Michael A. Henning , Sandi Klavžar , Douglas F. Rall

We investigate zero-sum turn-based two-player stochastic games in which the objective of one player is to maximize the amount of rewards obtained during a play, while the other aims at minimizing it. We focus on games in which the minimizer…

Logic in Computer Science · Computer Science 2022-05-20 Pablo F. Castro , Pedro R. D'Argenio , Luciano Putruele , Ramiro Demasi

In quenched disordered systems, the existence of ordering is generally believed to be only possible in the weak disorder regime (disregarding models of spin-glass type). In particular, sufficiently large random fields is expected to…

Mathematical Physics · Physics 2025-04-17 Andrew C. Yuan , Nick Crawford

Continuous and discrete game-theoretic models of dispersed material drying process are formalized and studied in the paper. The existence of optimal drying strategies is shown through application of results from the theory of differential…

Optimization and Control · Mathematics 2017-06-01 Oleg Malafeyev , Denis Rylow , Irina Zaitseva , Lydia Novozhilova

We consider a four-player game on the discrete hypercube $Q_n = \{0,1\}^n$, where each of the four players has chosen a single vertex of the hypercube. Such a position is called a profile. Imagine there is a voter at every vertex, and each…

Combinatorics · Mathematics 2025-10-30 Stelios Stylianou

We examine a two-person game we call Will-Testing in which the strategy space for both players is a real number. It has no equilibrium. When an infinitely large set of players plays this in all possible pairings, there is an equilibrium for…

Computer Science and Game Theory · Computer Science 2012-06-28 Leonid Gurvits , J. Stephen Judd

In the original Parrondo game, a single player combines two losing strategies to a winning strategy. In this paper we investigate the question what happens, if two or more players play Parrondo games in a coordinated way. We introduce a…

Statistical Mechanics · Physics 2023-06-14 Sandro Breuer , Andreas Mielke

We study a class of location games where players want to attract as many resources as possible and pay a cost when deviating from an exogenous reference location. This class of games includes political competitions between policy-interested…

Computer Science and Game Theory · Computer Science 2022-07-29 Fournier Gaëtan , Francou Amaury

This paper describes a novel method to increase the resistive Tc of cuprate superconductors to values that might approach room temperature if the method is applied to the so-called underdoped regime. This involves ordering the dopants that…

Superconductivity · Physics 2011-11-15 Stuart A. Wolf , Vladimir Z. Kresin

In the classical world, temperature is a measure of how hot or cold a physical object is. We never find a physical system which can be both hot and cold at the same time. Here, we show that for a quantum system, it is possible to have…

Quantum Physics · Physics 2021-12-21 Arun Kumar Pati , Avijit Misra

Repeated games have a long tradition in the behavioral sciences and evolutionary biology. Recently, strategies were discovered that permit an unprecedented level of control over repeated interactions by enabling a player to unilaterally…

Populations and Evolution · Quantitative Biology 2016-10-25 Alex McAvoy , Christoph Hauert

We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. We analyze outcomes with…

Probability · Mathematics 2015-05-29 Riddhipratim Basu , Alexander E. Holroyd , James B. Martin , Johan Wästlund

The 2-player impartial game of Wythoff Nim is played on two piles of tokens. A move consists in removing any number of tokens from precisely one of the piles or the same number of tokens from both piles. The winner is the player who removes…

Combinatorics · Mathematics 2010-10-29 Urban Larsson