Related papers: A two-player voting game in Euclidean space
We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each…
Quantum resources may provide advantage over their classical counterparts. Theoretically, in certain tasks, this advantage can be very high. In this work, we construct such a task based on a game, mediated by Referee and played between…
Introducing the simplest of all No-Signalling Games: the RGB Game where two verifiers interrogate two provers, Alice and Bob, far enough from each other that communication between them is too slow to be possible. Each prover may be…
In the game of Matching Pennies, Alice and Bob each hold a penny, and at every tick of the clock they simultaneously display the head or the tail sides of their coins. If they both display the same side, then Alice wins Bob's penny; if they…
Typical voting rules do not work well in settings with many candidates. If there are just several hundred candidates, then even a simple task such as choosing a top candidate becomes impractical. Motivated by the hope of developing group…
Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., "yes" and "no", every voting system can be described by a (monotone) Boolean function…
We give a (remote) quantum gambling scheme that makes use of the fact that quantum nonorthogonal states cannot be distinguished with certainty. In the proposed scheme, two participants Alice and Bob can be regarded as playing a game of…
We give operational meaning to wave-particle duality in terms of discrimination games. Duality arises as a constraint on the probability of winning these games. The games are played with the aid of an n-port interferometer, and involve 3…
The probability of a given candidate winning a future election is worked out in closed form as a function of (i) the current support rates for each candidate, (ii) the relative positioning of the candidates within the political spectrum,…
Social networks are increasingly being used to conduct polls. We introduce a simple model of such social polling. We suppose agents vote sequentially, but the order in which agents choose to vote is not necessarily fixed. We also suppose…
Many democratic countries use district-based elections where there is a "seat" for each district in the governing body. In each district, the party whose candidate gets the maximum number of votes wins the corresponding seat. The result of…
Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know…
The classical paradox of social choice theory asserts that there is no fair way to deterministically select a winner in an election among more than two candidates; the only definite collective preferences are between individual pairs of…
We study the bidimensional voter model on a square lattice with numerical simulations. We demonstrate that the evolution takes place in two distinct dynamic regimes; a first approach towards critical site percolation and a further approach…
When two qubits A and B are in an appropriate state, Alice can remotely steer Bob's system B into different ensembles by making different measurements on A. This famous phenomenon is known as quantum steering, or Einstein-Podolsky-Rosen…
In this paper, we study algorithms for special cases of energy games, a class of turn-based games on graphs that show up in the quantitative analysis of reactive systems. In an energy game, the vertices of a weighted directed graph belong…
The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…
The graph grabbing game is played on a non-negatively weighted connected graph by Alice and Bob who alternately claim a non-cut vertex from the remaining graph, where Alice plays first, to maximize the weights on their respective claimed…
The convex grabbing game is a game where two players, Alice and Bob, alternate taking extremal points from the convex hull of a point set on the plane. Rational weights are given to the points. The goal of each player is to maximize the…
The notions of entanglement and nonlocality are among the most striking ingredients found in quantum information theory. One tool to better understand these notions is the model of nonlocal games; a mathematical framework that abstractly…