English
Related papers

Related papers: Strategyproof Randomized Social Choice for Restric…

200 papers

We consider the multi-unit random assignment problem in which agents express preferences over objects and objects are allocated to agents randomly based on the preferences. The most well-established preference relation to compare random…

Computer Science and Game Theory · Computer Science 2015-06-22 Haris Aziz

This paper studies the strategic manipulation of set-valued social choice functions according to Kelly's preference extension, which prescribes that one set of alternatives is preferred to another if and only if all elements of the former…

Multiagent Systems · Computer Science 2015-02-06 Felix Brandt

We investigate the problem of designing randomized obviously strategy-proof (OSP) mechanisms in several canonical auction settings. Obvious strategy-proofness, introduced by Li [American Economic Review, 2017], strengthens the well-known…

Computer Science and Game Theory · Computer Science 2025-02-18 Shiri Ron , Daniel Schoepflin

We focus on the strategyproofness of voting systems where voters must choose a number of options among several possibilities. These systems include those that are used for Participatory Budgeting, where we organize an election to determine…

Computer Science and Game Theory · Computer Science 2022-10-07 Johanne Cohen , Daniel Cordeiro , Valentin Dardilhac , Victor Glaser

We consider the allocation of indivisible objects when agents have preferences over their own allocations, but share the ownership of the resources to be distributed. Examples might include seats in public schools, faculty offices, and time…

Theoretical Economics · Economics 2021-09-07 Mustafa Oğuz Afacan , Inácio Bó

Given a set of $n$ individuals with strict preferences over $m$ indivisible objects, the Random Serial Dictatorship (RSD) mechanism is a method for allocating objects to individuals in a way that is efficient, fair, and…

Theoretical Economics · Economics 2026-02-03 Maor Ben Zaquen , Ron Holzman

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

We study the problem of allocating multiple objects to agents without transferable utilities, where each agent may receive more than one object according to a quota. Under lexicographic preferences, we characterize the set of strategyproof,…

Computer Science and Game Theory · Computer Science 2016-12-20 Hadi Hosseini , Kate Larson

We characterize the class of group-strategyproof mechanisms for the single facility location game in any unconstrained strictly convex space. A mechanism is \emph{group-strategyproof}, if no group of agents can misreport so that all its…

Computer Science and Game Theory · Computer Science 2020-08-12 Pingzhong Tang , Dingli Yu , Shengyu Zhao

Data regulations increasingly enable consumers to switch among market segments, making segmentation an endogenous outcome of strategic interaction. We study a model in which consumers choose segments before a monopolist sets…

Theoretical Economics · Economics 2026-05-14 Zhonghong Kuang , Sanxi Li , Yi Liu , Yang Yu

We study the utilitarian distortion of social choice mechanisms under the recently proposed learning-augmented framework where some (possibly unreliable) predicted information about the preferences of the agents is given as input. In…

Computer Science and Game Theory · Computer Science 2025-02-11 Aris Filos-Ratsikas , Georgios Kalantzis , Alexandros A. Voudouris

Random dictatorship has been characterized as the only social decision scheme that satisfies efficiency and strategyproofness when individual preferences are strict. We show that no extension of random dictatorship to weak preferences…

Multiagent Systems · Computer Science 2018-04-19 Florian Brandl , Felix Brandt , Warut Suksompong

We initiate a novel direction in randomized social choice by proposing a new definition of agent utility for randomized outcomes. Each agent has a preference over all outcomes and a {\em quantile} parameter. Given a {\em lottery} over the…

Computer Science and Game Theory · Computer Science 2026-03-03 Ioannis Caragiannis , Fabian Frank , Sanjukta Roy

The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. Similar impossibility results hold even if we consider a weaker notion of strategy-proofness…

Computer Science and Game Theory · Computer Science 2015-01-08 Samantha Leung , Edward Lui , Rafael Pass

There are many situations in which mis-coordinated strategic voting can leave strategic voters worse off than they would have been had they not tried to strategize. We analyse the simplest of such scenarios, in which the set of strategic…

Computer Science and Game Theory · Computer Science 2013-01-09 Arkadii Slinko , Shaun White

Social choice theory offers a wealth of approaches for selecting a candidate on behalf of voters based on their reported preference rankings over options. When voters have underlying utilities for these options, however, using preference…

Computer Science and Game Theory · Computer Science 2025-10-24 Luise Ge , Gregory Kehne , Yevgeniy Vorobeychik

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…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam

Priority-based allocation of individuals to positions are pervasive, and elimination of justified envy is often, an absolute requirement. This leaves serial dictatorship (SD) as the only rule that avoids justified envy under standard direct…

Theoretical Economics · Economics 2026-05-22 Inácio Bó , Gian Caspari , Manshu Khanna

We determine the quality of randomized social choice mechanisms in a setting in which the agents have metric preferences: every agent has a cost for each alternative, and these costs form a metric. We assume that these costs are unknown to…

Artificial Intelligence · Computer Science 2016-09-27 Elliot Anshelevich , John Postl

Obviously strategyproof (OSP) mechanisms maintain the incentive compatibility of agents that are not fully rational. They have been object of a number of studies since their recent definition. A research agenda, initiated in…

Computer Science and Game Theory · Computer Science 2018-04-30 Diodato Ferraioli , Carmine Ventre