Related papers: Voting Power : A Generalised Framework
This article continues study of the prequential framework for evaluating a probability forecaster. Testing the hypothesis that the sequence of forecasts issued by the forecaster is in agreement with the observed outcomes can be done using…
Power transforms, such as the Box-Cox transform and Tukey's ladder of powers, are a fundamental tool in mathematics and statistics. These transforms are primarily used for normalizing and standardizing datasets, effectively by raising…
Generalized probabilistic theories (GPTs) provide a framework in which a range of possible theories can be examined, including classical theory, quantum theory and those beyond. In general, enlarging the state space of a GPT leads to fewer…
The Minority Game is a simple model for the collective behavior of agents in an idealized situation where they have to compete through adaptation for a finite resource. This review summarizes the statistical mechanics community efforts to…
Game theory is a powerful analytical tool for modeling decision makers strategies, behaviors and interactions. Act and decisions of a decision maker can benefit or negatively impact other decision makers interests. Game theory has been…
The development of state-of-the-art systems in different applied areas of machine learning (ML) is driven by benchmarks, which have shaped the paradigm of evaluating generalisation capabilities from multiple perspectives. Although the…
The framework of generalized probabilistic theories (GPTs) is a popular approach for studying the physical foundations of quantum theory. The standard framework assumes the no-restriction hypothesis, in which the state space of a physical…
We consider voting rules in settings where voters' identities are difficult to verify. Voters can manipulate the process by casting multiple votes under different identities or abstaining from voting. Immunities to such manipulations are…
Phase plays a crucial role in many quantum effects including interference. Phase is normally defined in terms of complex numbers that appear when representing quantum states as complex vectors. Here we give an operational definition whereby…
The goal of this paper is to simulate the voters behaviour given a voting method. Our approach uses a multi-agent simulation in order to model a voting process through many iterations, so that the voters can vote by taking into account the…
Voting is a game with a no-go theorem. New proofs of Arrow's impossibility theorem are given based on quantum information theory. We show that the Arrowian dictator is equivalent to the perfect cloning circuit. We present…
Power law or generalized polynomial regressions with unknown real-valued exponents and coefficients, and weakly dependent errors, are considered for observations over time, space or space--time. Consistency and asymptotic normality of…
This work proposes a view of probability as a relative measure rather than an absolute one. To demonstrate this concept, we focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative…
Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…
The indoctrination game is a complete-information contest over public opinion. The players exert costly effort to manifest their private opinions in public in order to control the discussion, so that the governing opinion is similar to…
A natural partial ordering exists on the set of all weighted games and, more broadly, on all linear games. We describe several properties of the partially ordered sets formed by these games and utilize this perspective to enumerate proper…
Score matching is an estimation procedure that has been developed for statistical models whose probability density function is known up to proportionality but whose normalizing constant is intractable, so that maximum likelihood is…
Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion.…
The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…
The question of how people vote strategically under uncertainty has attracted much attention in several disciplines. Theoretical decision models have been proposed which vary in their assumptions on the sophistication of the voters and on…