English
Related papers

Related papers: Keeping Your Friends Close: Land Allocation with F…

200 papers

When some resources are to be distributed among a set of agents following egalitarian social welfare, the goal is to maximize the utility of the agent whose utility turns out to be minimal. In this context, agents can have an incentive to…

Computer Science and Game Theory · Computer Science 2026-01-15 Jonathan Carrero , Ismael Rodriguez , Fernando Rubio

The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no two agents strictly prefer each other to their assigned partners. A…

Computer Science and Game Theory · Computer Science 2021-07-12 Michael McKay , David Manlove

We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the…

Computer Science and Game Theory · Computer Science 2019-05-10 Piotr Krysta , David Manlove , Baharak Rastegari , Jinshan Zhang

We consider the obnoxious facility location problem (in which agents prefer the facility location to be far from them) and propose a hierarchy of distance-based proportional fairness concepts for the problem. These fairness axioms ensure…

Computer Science and Game Theory · Computer Science 2024-11-08 Alexander Lam , Haris Aziz , Bo Li , Fahimeh Ramezani , Toby Walsh

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

As from time to time it is impractical to ask agents to provide linear orders over all alternatives, for these partial rankings it is necessary to conduct preference completion. Specifically, the personalized preference of each agent over…

Artificial Intelligence · Computer Science 2020-12-15 Lei Li , Minghe Xue , Huanhuan Chen , Xindong Wu

Sequential Social Dilemmas (SSDs) provide a key framework for studying how cooperation emerges when individual incentives conflict with collective welfare. In Multi-Agent Reinforcement Learning, these problems are often addressed by…

Machine Learning · Computer Science 2026-02-18 Alper Demir , Hüseyin Aydın , Kale-ab Abebe Tessera , David Abel , Stefano V. Albrecht

People often interact repeatedly: with relatives, through file sharing, in politics, etc. Many such interactions are reciprocal: reacting to the actions of the other. In order to facilitate decisions regarding reciprocal interactions, we…

Computer Science and Game Theory · Computer Science 2016-03-01 Gleb Polevoy , Mathijs de Weerdt , Catholijn Jonker

Schelling's model is an influential model that reveals how individual perceptions and incentives can lead to residential segregation. Inspired by a recent stream of work, we study welfare guarantees and complexity in this model with respect…

Computer Science and Game Theory · Computer Science 2022-03-21 Martin Bullinger , Warut Suksompong , Alexandros A. Voudouris

We consider a private variant of the classical allocation problem: given k goods and n agents with individual, private valuation functions over bundles of goods, how can we partition the goods amongst the agents to maximize social welfare?…

Computer Science and Game Theory · Computer Science 2018-03-16 Justin Hsu , Zhiyi Huang , Aaron Roth , Tim Roughgarden , Zhiwei Steven Wu

Principal-agent problems arise when one party acts on behalf of another, leading to conflicts of interest. The economic literature has extensively studied principal-agent problems, and recent work has extended this to more complex scenarios…

Artificial Intelligence · Computer Science 2024-01-02 Omer Ben-Porat , Yishay Mansour , Michal Moshkovitz , Boaz Taitler

The probabilistic serial (PS) rule is a prominent randomized rule for assigning indivisible goods to agents. Although it is well known for its good fairness and welfare properties, it is not strategyproof. In view of this, we address…

Computer Science and Game Theory · Computer Science 2015-04-01 Haris Aziz , Serge Gaspers , Simon Mackenzie , Nicholas Mattei , Nina Narodytska , Toby Walsh

This paper investigates the social optimality of linear quadratic mean field control systems with unmodeled dynamics. The objective of agents is to optimize the social cost, which is the sum of costs of all agents. By variational analysis…

Optimization and Control · Mathematics 2020-11-30 Bing-Chang Wang , Yong Liang

This paper is part of an ongoing endeavor to bring the theory of fair division closer to practice by handling requirements from real-life applications. We focus on two requirements originating from the division of land estates: (1) each…

Computer Science and Game Theory · Computer Science 2023-03-24 Edith Elkind , Erel Segal-Halevi , Warut Suksompong

We study the Price of Anarchy of mechanisms for the well-known problem of one-sided matching, or house allocation, with respect to the social welfare objective. We consider both ordinal mechanisms, where agents submit preference lists over…

Computer Science and Game Theory · Computer Science 2016-03-01 George Christodoulou , Aris Filos-Ratsikas , Soren Kristoffer Stiil Frederiksen , Paul W. Goldberg , Jie Zhang , Jinshan Zhang

We study resource allocation in two-sided markets from a fundamental perspective and introduce a general modeling and algorithmic framework to effectively incorporate the complex and multidimensional aspects of fairness. Our main technical…

Computer Science and Game Theory · Computer Science 2025-06-03 Javier Cembrano , Andrés Moraga , Victor Verdugo

In many applications such as rationing medical care and supplies, university admissions, and the assignment of public housing, the decision of who receives an allocation can be justified by various normative criteria. Such settings have…

Computer Science and Game Theory · Computer Science 2023-05-30 Siddhartha Banerjee , Matthew Eichhorn , David Kempe

Many centralized mechanisms for two-sided matching markets that enjoy strong theoretical properties assume that the planner solicits full information on the preferences of each participating agent. In particular, they expect that…

Computer Science and Game Theory · Computer Science 2025-06-09 Yuri Faenza , Aapeli Vuorinen

Recent literature highlights the advantages of implementing social rules via dynamic game forms. We characterize when truth-telling remains a dominant strategy in gradual mechanisms implementing strategy-proof social rules, where agents…

Theoretical Economics · Economics 2025-03-27 Wenqian Wang , Zhiwen Zheng

We study the truthful facility assignment problem, where a set of agents with private most-preferred points on a metric space are assigned to facilities that lie on the metric space, under capacity constraints on the facilities. The goal is…

Computer Science and Game Theory · Computer Science 2016-10-06 Ioannis Caragiannis , Aris Filos-Ratsikas , Soren Kristoffer Stiil Frederiksen , Kristoffer Arnsfelt Hansen , Zihan Tan
‹ Prev 1 3 4 5 6 7 10 Next ›