Related papers: A two-player voting game in Euclidean space
We introduce a spatially explicit model for the competition between type $a$ and type $b$ alleles. Each vertex of the $d$-dimensional integer lattice is occupied by a diploid individual, which is in one of three possible states or…
The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…
The constrained voter model describes the dynamics of opinions in a population of individuals located on a connected graph. Each agent is characterized by her opinion, where the set of opinions is represented by a finite sequence of…
In a two-player game, two cooperating but non communicating players, Alice and Bob, receive inputs taken from a probability distribution. Each of them produces an output and they win the game if they satisfy some predicate on their…
The \emph{graph grabbing game} is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them. Alice wins the game if she gains at least…
A fair coin is flipped $n$ times, and two finite sequences of heads and tails (words) $A$ and $B$ of the same length are given. Each time the word $A$ appears in the sequence of coin flips, Alice gets a point, and each time the word $B$…
Given a finite set of positive integers, $A$, and starting with a heap of $n$ chips, Alice and Bob alternate turns and on each turn a player chooses $x\in A$ with $x$ smaller or equal than the current number of chips and subtract $x$ chips…
We propose a new single-winner voting system using ranked ballots: Stable Voting. The motivating principle of Stable Voting is that if a candidate A would win without another candidate B in the election, and A beats B in a head-to-head…
In this note we consider situations of (multidimensional) spatial majority voting. We show that under some assumptions usual in this literature, with an even number of voters if the core of the voting situation is singleton (and in the…
The election control problem through social influence asks to find a set of nodes in a social network of voters to be the starters of a political campaign aiming at supporting a given target candidate. Voters reached by the campaign change…
Voters making a binary decision purchase votes from a centralized clearing house, paying the square of the number of votes purchased. The net payoff to an agent with utility $u$ who purchases $v$ votes is $\Psi (S_{n+1})u-v^{2}$, where…
We study a natural information dissemination problem for multiple mobile agents in a bounded Euclidean space. Agents are placed uniformly at random in the $d$-dimensional space $\{-n, ..., n\}^d$ at time zero, and one of the agents holds a…
We present a unifying framework encompassing many social choice settings. Viewing each social choice setting as voting in a suitable metric space, we consider a general model of social choice over metric spaces, in which---similarly to the…
Bob hides a ball in one of four drawers. Alice is to locate it. Classically she has to open up to three drawers, quantally just one. The fundamental reason for this quantum speedup is not known. The usual representation of the quantum…
The voter model is a toy model of consensus formation based on nearest-neighbor interactions. A voter sits at each vertex in a hypercubic lattice (of dimension $d$) and is in one of two possible opinion states. The opinion state of each…
Consider a game where Alice generates an integer and Bob wins if he can factor that integer. Traditional game theory tells us that Bob will always win this game even though in practice Alice will win given our usual assumptions about the…
In recent papers, the theory of representations of finite groups has been proposed to analyzing the violation of Bell inequalities. In this paper, we apply this method to more complicated cases. For two partite system, Alice and Bob each…
Quantum mechanics puts a restriction on the number of observers who can simultaneously steer another observer's system, known as the monogamy of steering. In this work we find the limit of the number of observers (Bobs) who can steer…
In Problem #1542 of Mathematics Magazine, Grossman and Turett define the Cantor game. In his 2007 Mathematics Magazine article about the Cantor game, Matt Baker proves several results and poses three challenging questions about it: Do there…
We consider the possibility of designing an election method that eliminates the incentives for a voter to rank any other candidate equal to or ahead of his or her sincere favorite. We refer to these methods as satisfying the ``Strong…