English
Related papers

Related papers: A Natural Adaptive Process for Collective Decision…

200 papers

Elections involving a very large voter population often lead to outcomes that surprise many. This is particularly important for the elections in which results affect the economy of a sizable population. A better prediction of the true…

Computer Science and Game Theory · Computer Science 2018-01-31 Palash Dey , Pravesh K. Kothari , Swaprava Nath

We consider an urn model with multiple drawing and random time-dependent addition matrix. The model is very general with respect to previous literature: the number of sampled balls at each time-step is random, the addition matrix has…

Probability · Mathematics 2021-07-06 Irene Crimaldi , Pierre-Yves Louis , Ida Germana Minelli

The generalized P\`olya urn (GPU) models and their variants have been investigated in several disciplines. However, typical assumptions made with respect to the GPU do not include urn models with diagonal replacement matrix, which arise in…

Probability · Mathematics 2015-02-24 Andrea Ghiglietti , Anand N. Vidyashankar , William F. Rosenberger

Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…

Probability · Mathematics 2012-05-31 Joe Neeman

We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number…

Probability · Mathematics 2015-07-09 Irene Crimaldi

When scheduling public works or events in a shared facility one needs to accommodate preferences of a population. We formalize this problem by introducing the notion of a collective schedule. We show how to extend fundamental tools from…

Computer Science and Game Theory · Computer Science 2018-03-21 Fanny Pascual , Krzysztof Rzadca , Piotr Skowron

We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum…

Probability · Mathematics 2016-04-07 Jiro Akahori , Andrea Collevecchio , Timothy Garoni , Kais Hamza

State-of-the-art results in typical classification tasks are mostly achieved by unexplainable machine learning methods, like deep neural networks, for instance. Contrarily, in this paper, we investigate the application of rule learning…

Machine Learning · Computer Science 2024-03-11 Albert Nössig , Tobias Hell , Georg Moser

Balls-and-bins games have been a wildly successful tool for modeling load balancing problems. In this paper, we study a new scenario, which we call the ball recycling game, defined as follows: Throw m balls into n bins i.i.d. according to a…

Data Structures and Algorithms · Computer Science 2018-11-05 Michael A. Bender , Jake Christensen , Alex Conway , Martín Farach-Colton , Rob Johnson , Meng-Tsung Tsai

Sortition is a political system in which decisions are made by panels of randomly selected citizens. The process for selecting a sortition panel is traditionally thought of as uniform sampling without replacement, which has strong fairness…

Computer Science and Game Theory · Computer Science 2020-10-30 Bailey Flanigan , Paul Gölz , Anupam Gupta , Ariel Procaccia

Understanding the nature of strategic voting is the holy grail of social choice theory, where game-theory, social science and recently computational approaches are all applied in order to model the incentives and behavior of voters. In a…

Multiagent Systems · Computer Science 2014-11-19 Reshef Meir

Let $G$ be a finite Abelian group of order $d$. We consider an urn in which, initially, there are labeled balls that generate the group $G$. Choosing two balls from the urn with replacement, observe their labels, and perform a group…

Probability · Mathematics 2022-11-30 Li Yang , Jiang Hu , Zhidong Bai

This paper presents some fundamental collective choice theory for information system designers, particularly those working in the field of computer-supported cooperative work. This paper is focused on a presentation of Arrow's Possibility…

Multiagent Systems · Computer Science 2007-05-23 Walter Eaves

We present a generalization of the maximal inequalities that upper bound the expectation of the maximum of $n$ jointly distributed random variables. We control the expectation of a randomly selected random variable from $n$ jointly…

Probability · Mathematics 2017-08-31 Jiantao Jiao , Yanjun Han , Tsachy Weissman

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

Lotteries are a prevalent form of gambling between a seller and buyers. Designing a lottery requires a model of how buyers make decisions when confronted with uncertain outcomes. Cumulative prospect theory (CPT) is a descriptive model that…

Computer Science and Game Theory · Computer Science 2026-05-20 Shunta Akiyama , Mitsuaki Obara , Yasushi Kawase

We outline how to create a mechanism that provides an optimal way to elicit, from an arbitrary group of experts, the probability of the truth of an arbitrary logical proposition together with collective information that has an explicit form…

Computer Science and Game Theory · Computer Science 2023-09-04 Alexey V. Osipov , Nikolay N. Osipov

In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…

Artificial Intelligence · Computer Science 2014-05-26 Phil Maguire , Philippe Moser , Rebecca Maguire , Mark Keane

For a voting ensemble that selects an odd-sized subset of the ensemble classifiers at random for each example, applies them to the example, and returns the majority vote, we show that any number of voters may minimize the error rate over an…

Machine Learning · Computer Science 2021-04-27 Eric Bax

In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made…

Artificial Intelligence · Computer Science 2013-03-05 Umberto Grandi , Andrea Loreggia , Francesca Rossi , Kristen Brent Venable , Toby Walsh