English
Related papers

Related papers: Impartial Selection with Additive Guarantees via I…

200 papers

Let V be a finite society whose members express weak orderings (hence also indifference, possibly) about two alternatives. We show a simple representation formula that is valid for all, and only, anonymous, non-manipulable, binary social…

Theoretical Economics · Economics 2020-07-06 Achille Basile , Surekha Rao , K. P. S. Bhaskara Rao

Lu and Boutilier proposed a novel approach based on "minimax regret" to use classical score based voting rules in the setting where preferences can be any partial (instead of complete) orders over the set of alternatives. We show here that…

Multiagent Systems · Computer Science 2017-11-13 Palash Dey

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

Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of this form. It…

Artificial Intelligence · Computer Science 2020-04-03 Jasper De Bock

A quota mechanism, such as a mandatory grading curve, links together multiple decisions. We analyze the performance of quota mechanisms when the number of linked decisions is finite and the designer has imperfect knowledge of the type…

Theoretical Economics · Economics 2026-04-10 Ian Ball , Deniz Kattwinkel

The unit selection problem aims to identify a set of individuals who are most likely to exhibit a desired mode of behavior, for example, selecting individuals who would respond one way if encouraged and a different way if not encouraged.…

Artificial Intelligence · Computer Science 2022-08-23 Ang Li , Judea Pearl

Perpetual voting studies fair collective decision-making in settings where many decisions are to be made, and is a natural framework for settings such as parliaments and the running of blockchain Decentralized Autonomous Organizations…

Computer Science and Game Theory · Computer Science 2024-08-19 Yotam Gafni , Ben Golan

We consider a committee voting on whether to adopt a reform under a quota rule, where members differ in how much they value the reform some supporting it, others opposing it. We examine how members can influence each other's votes through…

General Economics · Economics 2025-05-19 Ali Lazrak , Jianfeng Zhang

In many institutional settings, $k$ items are selected with the goal of representing the underlying distribution of claims, opinions, or characteristics in a large population. We study environments with two adversarial parties whose…

Theoretical Economics · Economics 2026-03-27 Alma Cohen , Alon Klement , Zvika Neeman , Eilon Solan

Elections and opinion polls often have many candidates, with the aim to either rank the candidates or identify a small set of winners according to voters' preferences. In practice, voters do not provide a full ranking; instead, each voter…

Computer Science and Game Theory · Computer Science 2019-08-16 Nikhil Garg , Lodewijk Gelauff , Sukolsak Sakshuwong , Ashish Goel

We argue that an imperfect criminal law procedure cannot be group-fair, if 'group fairness' involves ensuring the same chances of acquittal or convictions to all innocent defendants independently of their morally arbitrary features. We show…

Computers and Society · Computer Science 2022-02-09 Nicolò Cangiotti , Michele Loi

History-deterministic automata are those in which nondeterministic choices can be correctly resolved stepwise: there is a strategy to select a continuation of a run given the next input letter so that if the overall input word admits some…

Formal Languages and Automata Theory · Computer Science 2026-04-01 Soumyajit Paul , David Purser , Sven Schewe , Qiyi Tang , Patrick Totzke , Di-De Yen

This paper describes three methods for carrying out non-asymptotic inference on partially identified parameters that are solutions to a class of optimization problems. Applications in which the optimization problems arise include estimation…

Methodology · Statistics 2022-12-02 Joel L. Horowitz , Sokbae Lee

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

The role of an expert in the decision-making process is crucial, as the final recommendation depends on his disposition, clarity of mind, experience, and knowledge of the problem. However, the recommendation also depends on their honesty.…

Artificial Intelligence · Computer Science 2024-05-28 Jacek Szybowski , Konrad Kułakowski , Sebastian Ernst

Coalitional manipulation in voting is considered to be any scenario in which a group of voters decide to misrepresent their vote in order to secure an outcome they all prefer to the first outcome of the election when they vote honestly. The…

Theoretical Economics · Economics 2020-09-28 Mostapha Diss , Boris Tsvelikhovskiy

The responsibility gap is a set of outcomes of a collective decision-making mechanism in which no single agent is individually responsible. In general, when designing a decision-making process, it is desirable to minimise the gap. The paper…

Computer Science and Game Theory · Computer Science 2025-05-13 Pavel Naumov , Jia Tao

Budgetary constraints force organizations to pursue only a subset of possible innovation projects. Identifying which subset is most promising is an error-prone exercise, and involving multiple decision makers may be prudent. This raises the…

Theoretical Economics · Economics 2025-10-21 Lucas Böttcher , Ronald Klingebiel

Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…

Logic · Mathematics 2011-12-13 Eric J. Hall , Saharon Shelah

We follow a connection between tight determinisation and complementation and establish a complementation procedure from parity automata to nondeterministic B\"uchi automata and prove it to be tight up to an $O(n)$ factor, where $n$ is the…

Formal Languages and Automata Theory · Computer Science 2014-09-12 Sven Schewe , Thomas Varghese