English
Related papers

Related papers: Random Tie-breaking with Stochastic Dominance

200 papers

Statisticians have recently developed propensity score methods to improve generalizations from randomized experiments that do not employ random sampling. However, these methods typically rely on assumptions whose plausibility may be…

Methodology · Statistics 2019-11-14 Wendy Chan

A change in a stochastic system has three representations: Probabilistic, statistical, and informational: (i) is based on random variable $u(\omega)\to\tilde{u}(\omega)$; this induces (ii) the probability distributions $F_u(x)\to…

Statistical Mechanics · Physics 2019-02-27 Hong Qian , Yu-Chen Cheng , Lowell F. Thompson

We introduce a new class of heavy-tailed distributions for which any weighted average of independent and identically distributed random variables is larger than one such random variable in (usual) stochastic order. We show that many…

Probability · Mathematics 2025-06-18 Yuyu Chen , Seva Shneer

We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such…

Computer Science and Game Theory · Computer Science 2023-05-18 Piotr Faliszewski , Andrzej Kaczmarczyk , Krzysztof Sornat , Stanisław Szufa , Tomasz Wąs

Consideration was given to a model of social dynamics controlled by successive collective decisions based on the threshold majority procedures. The current system state is characterized by the vector of participants' capitals (utilities).…

Optimization and Control · Mathematics 2009-02-27 V. I. Borzenko , Z. M. Lezina , A. K. Loginov , Ya. Yu. Tsodikova , P. Yu. Chebotarev

Social choice theory is the study of preference aggregation across a population, used both in mechanism design for human agents and in the democratic alignment of language models. In this study, we propose the representative social choice…

Machine Learning · Computer Science 2025-11-03 Tianyi Qiu

The extremal characteristics of random structures, including trees, graphs, and networks, are discussed. A statistical physics approach is employed in which extremal properties are obtained through suitably defined rate equations. A variety…

Statistical Mechanics · Physics 2007-05-23 E. Ben-Naim , P. L. Krapivsky , S. Redner

Conventional preference learning methods often prioritize opinions held more widely when aggregating preferences from multiple evaluators. This may result in policies that are biased in favor of some types of opinions or groups and…

Artificial Intelligence · Computer Science 2026-03-03 Kihyun Kim , Jiawei Zhang , Asuman Ozdaglar , Pablo A. Parrilo

The paper presents the investigation and implementation of the relationship between diversity and the performance of multiple classifiers on classification accuracy. The study is critical as to build classifiers that are strong and can…

Artificial Intelligence · Computer Science 2008-10-22 R. Musehane , F. Netshiongolwe , F. V. Nelwamondo , L. Masisi , T. Marwala

We review old and new uses of exchangeability, emphasizing the general theme of exchangeable representations of complex random structures. Illustrations of this theme include processes of stochastic coalescence and fragmentation; continuum…

Probability · Mathematics 2010-02-22 David J. Aldous

In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that…

Computer Science and Game Theory · Computer Science 2016-12-06 Piotr Skowron , Martin Lackner , Markus Brill , Dominik Peters , Edith Elkind

The mathematical study of voting, social choice theory, has traditionally only been applicable to choices among a few predetermined alternatives, but not to open-ended decisions such as collectively selecting a textual statement. We…

Computer Science and Game Theory · Computer Science 2025-03-07 Sara Fish , Paul Gölz , David C. Parkes , Ariel D. Procaccia , Gili Rusak , Itai Shapira , Manuel Wüthrich

We consider sequential or active ranking of a set of n items based on noisy pairwise comparisons. Items are ranked according to the probability that a given item beats a randomly chosen item, and ranking refers to partitioning the items…

Machine Learning · Computer Science 2016-09-26 Reinhard Heckel , Nihar B. Shah , Kannan Ramchandran , Martin J. Wainwright

For massive and heterogeneous modern datasets, it is of fundamental interest to provide guarantees on the accuracy of estimation when computational resources are limited. In the application of learning to rank, we provide a hierarchy of…

Machine Learning · Computer Science 2016-08-23 Ashish Khetan , Sewoong Oh

We consider the problem of assessing the importance of multiple variables or factors from a dataset when side information is available. In principle, using side information can allow the statistician to pay attention to variables with a…

Methodology · Statistics 2020-01-23 Zhimei Ren , Emmanuel Candès

How do competing populations convert a spatial advantage into macroscopic dominance? We introduce a stochastic model for resource competition that decouples the transient discovery phase from monopolization. Initial symmetry breaking is…

Populations and Evolution · Quantitative Biology 2026-03-12 Stuti Guha , Shawn D. Ryan , Bhargav R. Karamched

Recent theoretical studies have shown that demographic stochasticity can greatly increase the tendency of asexually reproducing phenotypically diverse organisms to spontaneously evolve into localised clusters, suggesting a simple mechanism…

Populations and Evolution · Quantitative Biology 2016-03-23 Luis F. Lafuerza , Alan J. McKane

In the context of voting with ranked ballots, an important class of voting rules is the class of margin-based rules (also called pairwise rules). A voting rule is margin-based if whenever two elections generate the same head-to-head margins…

Theoretical Economics · Economics 2026-03-11 Yifeng Ding , Wesley H. Holliday , Eric Pacuit

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

A common approach to aggregate classification estimates in an ensemble of decision trees is to either use voting or to average the probabilities for each class. The latter takes uncertainty into account, but not the reliability of the…

Machine Learning · Computer Science 2022-08-17 Florian Busch , Moritz Kulessa , Eneldo Loza Mencía , Hendrik Blockeel