English
Related papers

Related papers: Constrained Serial Dictatorships can be Fair

200 papers

We consider multi-agent systems where agents' preferences are aggregated via sequential majority voting: each decision is taken by performing a sequence of pairwise comparisons where each comparison is a weighted majority vote among the…

Artificial Intelligence · Computer Science 2012-04-18 Maria Pini , Francesca Rossi , Brent Venable , Toby Walsh

We study the probabilistic assignment of items to platforms that satisfies both group and individual fairness constraints. Each item belongs to specific groups and has a preference ordering over platforms. Each platform enforces group…

Artificial Intelligence · Computer Science 2024-05-13 Atasi Panda , Anand Louis , Prajakta Nimbhorkar

We consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen…

Computer Science and Game Theory · Computer Science 2019-02-06 Warut Suksompong

Goods and services -- public housing, medical appointments, schools -- are often allocated to individuals who rank them similarly but differ in their preference intensities. We characterize optimal allocation rules when individual…

Theoretical Economics · Economics 2021-08-30 Pietro Ortoleva , Evgenii Safonov , Leeat Yariv

We study the problem of exchange when 1) agents are endowed with heterogeneous indivisible objects, and 2) there is no money. In general, no rule satisfies the three central properties Pareto-efficiency, individual rationality, and…

Computer Science and Game Theory · Computer Science 2018-03-08 William Phan , Christopher Purcell

Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…

Optimization and Control · Mathematics 2021-08-02 Navid Rezazadeh , Solmaz S. Kia

We study information aggregation with a decision maker aggregating binary recommendations from symmetric agents. Each agent's recommendation depends on her private information about a hidden state. While the decision maker knows the prior…

Computer Science and Game Theory · Computer Science 2023-11-17 Itai Arieli , Yakov Babichenko , Inbal Talgam-Cohen , Konstantin Zabarnyi

We establish that all strategy-proof social choice rules in strict preference domains follow necessarily a two-step procedure. In the first step, agents are asked to reveal some specific information about their preferences. Afterwards, a…

Theoretical Economics · Economics 2023-04-26 Jorge Alcalde-Unzu , Marc Vorsatz

Many interventions, such as vaccines in clinical trials or coupons in online marketplaces, must be assigned sequentially without full knowledge of their effects. Multi-armed bandit algorithms have proven successful in such settings.…

Machine Learning · Statistics 2026-05-07 Aidan Gleich , Eric Laber , Alexander Volfovsky

Discrete-choice models are used in economics, marketing and revenue management to predict customer purchase probabilities, say as a function of prices and other features of the offered assortment. While they have been shown to be…

Artificial Intelligence · Computer Science 2023-08-11 Hanzhao Wang , Zhongze Cai , Xiaocheng Li , Kalyan Talluri

This paper considers a problem where multiple users make repeated decisions based on their own observed events. The events and decisions at each time step determine the values of a utility function and a collection of penalty functions. The…

Optimization and Control · Mathematics 2013-05-13 Michael J. Neely

We consider the problem of sequential evaluation, in which an evaluator observes candidates in a sequence and assigns scores to these candidates in an online, irrevocable fashion. Motivated by the psychology literature that has studied…

Machine Learning · Statistics 2023-11-20 Jingyan Wang , Ashwin Pananjady

We present a simple and natural non-pricing mechanism for allocating divisible goods among strategic agents having lexicographic preferences. Our mechanism has favorable properties of incentive compatibility (strategy-proofness), Pareto…

Computer Science and Game Theory · Computer Science 2017-02-17 Leonard J. Schulman , Vijay V. Vazirani

We consider a multi-agent resource allocation setting that models the assignment of papers to reviewers. A recurring issue in allocation problems is the compatibility of welfare/efficiency and fairness. Given an oracle to find a…

Computer Science and Game Theory · Computer Science 2019-08-02 Haris Aziz , Xin Huang , Nicholas Mattei , Erel Segal-Halevi

In dynamic programming and reinforcement learning, the policy for the sequential decision making of an agent in a stochastic environment is usually determined by expressing the goal as a scalar reward function and seeking a policy that…

Artificial Intelligence · Computer Science 2025-02-26 Simon Dima , Simon Fischer , Jobst Heitzig , Joss Oliver

This paper establishes non-asymptotic convergence of the cutoffs in Random serial dictatorship in an environment with many students, many schools, and arbitrary student preferences. Convergence is shown to hold when the number of schools,…

Theoretical Economics · Economics 2026-05-26 Suhas Vijaykumar

Humans have come to rely on machines for reducing excessive information to manageable representations. But this reliance can be abused -- strategic machines might craft representations that manipulate their users. How can a user make good…

Machine Learning · Computer Science 2022-06-20 Vineet Nair , Ganesh Ghalme , Inbal Talgam-Cohen , Nir Rosenfeld

Systematic discriminatory biases present in our society influence the way data is collected and stored, the way variables are defined, and the way scientific findings are put into practice as policy. Automated decision procedures and…

Machine Learning · Computer Science 2019-05-29 Razieh Nabi , Daniel Malinsky , Ilya Shpitser

We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…

Computer Science and Game Theory · Computer Science 2025-10-07 Eugene Lim , Tzeh Yuan Neoh , Nicholas Teh

Motivated by applications to word-of-mouth advertising, we consider a game-theoretic scenario in which competing advertisers want to target initial adopters in a social network. Each advertiser wishes to maximize the resulting cascade of…

Computer Science and Game Theory · Computer Science 2014-03-26 Allan Borodin , Mark Braverman , Brendan Lucier , Joel Oren