English
Related papers

Related papers: Asylum Assignment and Burden-Sharing

200 papers

Using school choice as a motivating example, we introduce a stylized model of a many-to-one matching market where the clearinghouse aims to implement contingent priorities, i.e., priorities that depend on the current assignment, to…

Computer Science and Game Theory · Computer Science 2024-09-10 Ignacio Rios , Federico Bobbio , Margarida Carvalho , Alfredo Torrico

We study the problem of an organization that matches agents to objects where agents have preference rankings over objects and the organization uses algorithms to construct a ranking over objects on behalf of each agent. Our new framework…

Theoretical Economics · Economics 2025-08-12 Terence Highsmith

We consider social resource allocations that deliver an array of scarce supports to a diverse population. Such allocations pervade social service delivery, such as provision of homeless services, assignment of refugees to cities, among…

Computers and Society · Computer Science 2022-02-28 Tasfia Mashiat , Xavier Gitiaux , Huzefa Rangwala , Patrick J. Fowler , Sanmay Das

This article studies the stability of solutions of equilibrium equations arising in so-called resource dependent branching processes. We argue that these new models, building on the model already presented by Bruss (1984 a), refined and…

Probability · Mathematics 2020-03-10 F. Thomas Bruss

I study how organisations choose selection procedures in a competitive environment. Two firms compete to hire candidates of unknown productivity from a common pool. Firms simultaneously post a selection procedure which consists of a test…

Theoretical Economics · Economics 2026-05-01 Nathan Hancart

We consider a setting where goods are allocated to agents by way of an allocation platform (e.g., a matching platform). An ``allocation facilitator'' aims to increase the overall utility/social-good of the allocation by encouraging (some of…

Computer Science and Game Theory · Computer Science 2025-08-27 Yohai Trabelsi , Abhijin Adiga , Yonatan Aumann , Sarit Kraus , S. S. Ravi

Legal systems shape not only the recognition of migrants and refugees but also the pace and stability of their integration. Refugees often shift between multiple legal classifications, a process we refer to as the "legal journey". This…

We introduce balancedness a fairness axiom in house allocation problems. It requires a mechanism to assign the top choice, the second top choice, and so on, on the same number of profiles for each agent. This axiom guarantees equal…

Theoretical Economics · Economics 2021-09-07 Xinghua Long , Rodrigo A. Velez

Building fair recommender systems is a challenging and crucial area of study due to its immense impact on society. We extended the definitions of two commonly accepted notions of fairness to recommender systems, namely equality of…

Machine Learning · Statistics 2022-08-12 Preetam Nandy , Cyrus Diciccio , Divya Venugopalan , Heloise Logan , Kinjal Basu , Noureddine El Karoui

Stable matching theory is the foundation of centralized clearinghouses worldwide, from school choice programs to medical residency allocations. However, incorporating complex distributional goals-such as multi-dimensional diversity quotas…

Computer Science and Game Theory · Computer Science 2026-05-01 Gergely Csáji , Zhaohong Sun

The ongoing pandemic has highlighted the importance of reliable and efficient clinical trials in healthcare. Trial sites, where the trials are conducted, are chosen mainly based on feasibility in terms of medical expertise and access to a…

Machine Learning · Computer Science 2022-04-14 Rakshith S Srinivasa , Cheng Qian , Brandon Theodorou , Jeffrey Spaeder , Cao Xiao , Lucas Glass , Jimeng Sun

The problem of guiding a flock of several autonomous agents using repulsion force exerted by a smaller number of agents is called the shepherding problem and has been attracting attention due to its potential engineering applications.…

Multiagent Systems · Computer Science 2023-04-11 Anna Fujioka , Masaki Ogura , Naoki Wakamiya

We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and…

Data Structures and Algorithms · Computer Science 2018-08-13 Itai Ashlagi , Maximilien Burq , Chinmoy Dutta , Patrick Jaillet , Amin Saberi , Chris Sholley

Algorithmic fairness in the context of personalized recommendation presents significantly different challenges to those commonly encountered in classification tasks. Researchers studying classification have generally considered fairness to…

Artificial Intelligence · Computer Science 2024-02-28 Amanda Aird , Paresha Farastu , Joshua Sun , Elena Štefancová , Cassidy All , Amy Voida , Nicholas Mattei , Robin Burke

The Rashomon set of equally-good models promises less discriminatory algorithms, reduced outcome homogenization, and fairer decisions through model ensembles or reconciliation. However, we argue from the perspective of allocation…

Computers and Society · Computer Science 2025-09-03 Shomik Jain , Margaret Wang , Kathleen Creel , Ashia Wilson

We consider a matching system where items arrive one by one at each node of a compatibility network according to Poisson processes and depart from it as soon as they are matched to a compatible item. The matching policy considered is a…

Probability · Mathematics 2020-11-10 Matthieu Jonckheere , Pascal Moyal , Claudia Ramírez , Nahuel Soprano-Loto

Migration's impact spans various social dimensions, including demography, sustainability, politics, economy and gender disparities. Yet, the decision-making process behind migrants choosing their destination remains elusive. Existing models…

This paper considers the problem of offering a scarce object with a common unobserved quality to strategic agents in a priority queue. Each agent has a private signal over the quality of the object and observes the decisions made by other…

Computer Science and Game Theory · Computer Science 2024-05-01 Itai Ashlagi , Jamie Kang , Moran Koren , Faidra Monachou

The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the…

Computer Science and Game Theory · Computer Science 2017-03-14 Jacky Lo , Mark C. Wilson

We study the problem of capacity modification in the many-to-one stable matching of workers and firms. Our goal is to systematically study how the set of stable matchings changes when some seats are added to or removed from the firms. We…

Computer Science and Game Theory · Computer Science 2025-07-11 Salil Gokhale , Shivika Narang , Samarth Singla , Rohit Vaish