English
Related papers

Related papers: A Toom rule that increases the thickness of sets

200 papers

Voting systems typically treat all voters equally. We argue that perhaps they should not: Voters who have supported good choices in the past should be given higher weight than voters who have supported bad ones. To develop a formal…

Computer Science and Game Theory · Computer Science 2017-03-16 Nika Haghtalab , Ritesh Noothigattu , Ariel D. Procaccia

May's classical theorem states that in a single-winner choose-one voting system with just two candidates, majority rule is the only social choice function satisfying anonimity, neutrality and positive responsiveness axiom. Anonimity and…

Theoretical Economics · Economics 2023-10-23 Mateusz Krukowski

May's Theorem [K. O. May, Econometrica 20 (1952) 680-684] characterizes majority voting on two alternatives as the unique preferential voting method satisfying several simple axioms. Here we show that by adding some desirable axioms to…

Theoretical Economics · Economics 2025-04-29 Wesley H. Holliday , Eric Pacuit

We discuss a modification of the Evolutionary Minority Game (EMG) in which agents are placed in the nodes of a regular or a random graph. A neighborhood for each agent can thus be defined and a modification of the usual relaxation dynamics…

Condensed Matter · Physics 2007-05-23 E. Burgos , Horacio Ceva , R. P. J. Perazzo

We add small random perturbations to a cellular automaton and consider the one-parameter family $(F_\epsilon)_{\epsilon>0}$ parameterized by $\epsilon$ where $\epsilon>0$ is the level of noise. The objective of the article is to study the…

Dynamical Systems · Mathematics 2024-12-11 Hugo Marsan , Mathieu Sablik

Pull voting is a classic method to reach consensus among $n$ vertices with differing opinions in a distributed network: each vertex at each step takes on the opinion of a random neighbour. This method, however, suffers from two drawbacks.…

Discrete Mathematics · Computer Science 2017-04-14 Colin Cooper , Tomasz Radzik , Nicolás Rivera , Takeharu Shiraga

In boosting, we aim to leverage multiple weak learners to produce a strong learner. At the center of this paradigm lies the concept of building the strong learner as a voting classifier, which outputs a weighted majority vote of the weak…

Machine Learning · Computer Science 2024-12-23 Arthur da Cunha , Kasper Green Larsen , Martin Ritzert

Consider an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is $p>1/2$. Condorcet's Jury Theorem which he derived from the weak law of large…

Probability · Mathematics 2007-05-23 Olle Haggstrom , Gil Kalai , Elchanan Mossel

In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the…

Computer Science and Game Theory · Computer Science 2026-05-21 Ulle Endriss , Federico Fioravanti

The Majority Rule is applied to a topology that consists of two coupled random networks, thereby mimicking the modular structure observed in social networks. We calculate analytically the asymptotic behaviour of the model and derive a phase…

Physics and Society · Physics 2012-08-31 R. Lambiotte , M. Ausloos

Collective motion in animals and cells often exhibits rapid reorientations and scale-free velocity correlations. This allows information to spread rapidly through the group, allowing an adequate collective response to environmental changes…

Quantitative Methods · Quantitative Biology 2026-03-12 Simon Syga , Chandraniva Guha Ray , Josué Manik Nava-Sedeño , Fernando Peruani , Andreas Deutsch

Multiplicative noise is found to divide the growth law of tumors into two parts in a logistic model, which is driven by additive and multiplicative noises simultaneously. The Fokker-Planck equation was also derived to explain the fact that…

Biological Physics · Physics 2007-05-23 Wei-Rong Zhong , Yuan-Zhi Shao , Zhen-Hui He

Non-orthogonal multiple access (NOMA) allows multiple users to simultaneously access the same time-frequency resource by using superposition coding and successive interference cancellation (SIC). Thus far, most papers on NOMA have focused…

Information Theory · Computer Science 2017-12-12 Lei You , Lei Lei , Di Yuan , Sumei Sun , Symeon Chatzinotas , Björn Ottersten

We investigate the use of an extension of rule-based modelling for cellular signalling to create a structured space of model variants. This enables the incremental development of rule sets that start from simple mechanisms and which, by a…

Other Computer Science · Computer Science 2009-11-16 Russ Harmer

We introduce a novel definition for a small set R of k points being "representative" of a larger set in a metric space. Given a set V (e.g., documents or voters) to represent, and a set C of possible representatives, our criterion requires…

Computer Science and Game Theory · Computer Science 2024-01-25 Yusuf Hakan Kalayci , David Kempe , Vikram Kher

We investigate a process of growth of a signed network that strictly adheres to Heider structural balance rules, resulting in two opposing, growing factions. New agents make contact with a random existing agent and join one of the factions…

We study a version of the minority game in which one agent is allowed to join the game in a random fashion. It is shown that in the crowded regime, i.e., for small values of the memory size $m$ of the agents in the population, the agent…

Statistical Mechanics · Physics 2009-11-10 K. F. Yip , T. S. Lo , P. M. Hui , N. F. Johnson

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

Let $m\geq 2$ be a positive integer. Given a set $E(\omega )\subseteq \mathbb{N}$ we define $r_{N}^{(m)}(\omega )$ to be the number of ways to represent $N\in \mathbb{Z}$ as any combination of sums $\textit{ and }$ differences of $m$…

Number Theory · Mathematics 2015-09-07 Kathryn Hare , Shuntaro Yamagishi

Machine learning models (e.g., speech recognizers) are usually trained to minimize average loss, which results in representation disparity---minority groups (e.g., non-native speakers) contribute less to the training objective and thus tend…

Machine Learning · Statistics 2018-08-01 Tatsunori B. Hashimoto , Megha Srivastava , Hongseok Namkoong , Percy Liang