Related papers: Some online Maker-Breaker games
In this paper we analyze classical Maker-Breaker games played on the edge set of a sparse random board $G\sim \gnp$. We consider the Hamiltonicity game, the perfect matching game and the $k$-connectivity game. We prove that for $p(n)\geq…
Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the players keep moving a token along the edges according to…
In many combinatorial games, one can prove that the first player wins under best play using a simple but non-constructive argument called strategy-stealing. This work is about the complexity behind these proofs: how hard is it to actually…
This paper investigates how risk influences the way people barter. We used Minecraft to create an experimental environment in which people bartered to earn a monetary bonus. Our findings reveal that subjects exhibit risk-aversion to…
Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different…
Open world games present players with more freedom than games with linear progression structures. However, without clearly-defined objectives, they often leave players without a sense of purpose. Most of the time, quests and objectives are…
We consider a setting where $n$ buyers, with combinatorial preferences over $m$ items, and a seller, running a priority-based allocation mechanism, repeatedly interact. Our goal, from observing limited information about the results of these…
Money laundering is a critical step in the cyber crime process which is experiencing some changes as hackers and their criminal colleagues continually alter and optimize payment mechanisms. Conducting quantitative research on underground…
We consider transformations of normal form games by binding preplay offers of players for payments of utility to other players conditional on them playing designated in the offers strategies. The game-theoretic effect of such preplay offers…
Resource allocation in adversarial environments is a fundamental challenge across various domains, from corporate competition to military strategy. This article examines the impact of compromising an opponent's strategic intent in the…
The popularity of computer games is remarkably high and is still growing every year. Despite this popularity and the economical importance of gaming, research in game design, or to be more precise, of game mechanics that can be used to…
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a piece, and hands them to an adversary who distributes them among the vertices of G (called a configuration) and chooses a target vertex r. The…
Hybrid board games (HBGs) augment their analog origins digitally (e.g., through apps) and are an increasingly popular pastime activity. Continuous world and character development and customization, known to facilitate engagement in video…
We study the algorithmic complexity of Maker-Breaker games played on the edge sets of general graphs. We mainly consider the perfect matching game and the $H$-game. Maker wins if she claims the edges of a perfect matching in the first, and…
Two-player graph games are a fundamental model for reasoning about the interaction of agents. These games are played between two players who move a token along a graph. In bidding games, the players have some monetary budget, and at each…
We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning…
The Maker-Maker convention of positional games is played on a hypergraph whose edges are interpreted as winning sets. Two players take turns picking a previously unpicked vertex, aiming at being first to pick all the vertices of some edge.…
For a positive integer $k$ we consider the $k$-vertex-connectivity game, played on the edge set of $K_n$, the complete graph on $n$ vertices. We first study the Maker-Breaker version of this game and prove that, for any integer $k \geq 2$…
Given a tree $T=(V,E)$ on $n$ vertices, we consider the $(1 : q)$ Maker-Breaker tree embedding game ${\mathcal T}_n$. The board of this game is the edge set of the complete graph on $n$ vertices. Maker wins ${\mathcal T}_n$ if and only if…
We introduce and analyze a variation of the Bertrand game in which the revenue is shared between two players. This game models situations in which one economic agent can provide goods/services to consumers either directly or through an…