Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange

01/30/2021
by   Péter Biró, et al.
0

In a housing market of Shapley and Scarf, each agent is endowed with one indivisible object and has preferences over all objects. An allocation of the objects is in the (strong) core if there exists no (weakly) blocking coalition. In this paper we show that in the case of strict preferences the unique strong core allocation (or competitive allocation) respects improvement: if an agent's object becomes more attractive for some other agents, then the agent's allotment in the unique strong core allocation weakly improves. We obtain a general result in case of ties in the preferences and provide new integer programming formulations for computing (strong) core and competitive allocations. Finally, we conduct computer simulations to compare the game-theoretical solutions with maximum size and maximum weight exchanges for markets that resemble the pools of kidney exchange programmes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/13/2021

The core of housing markets from an agent's perspective: Is it worth sprucing up your home?

We study housing markets as introduced by Shapley and Scarf (1974). We i...
research
06/15/2023

House-Swapping with Objective Indifferences

We study the classic house-swapping problem of Shapley and Scarf (1974) ...
research
05/19/2020

Coalition and Core in Resource Allocation and Exchange

In discrete exchange economies with possibly redundant and joint ownersh...
research
09/12/2021

Matching markets with middlemen under transferable utility

This paper studies matching markets in the presence of middlemen. In our...
research
11/15/2019

Graphical One-Sided Markets

We study the problem of allocating indivisible objects to a set of ratio...
research
05/26/2019

Strategyproof Multi-Item Exchange Under Single-Minded Dichotomous Preferences

We consider multi-item exchange markets in which agents want to receive ...
research
12/20/2020

The Probabilistic Serial and Random Priority Mechanisms with Minimum Quotas

Consider the problem of assigning indivisible objects to agents with str...

Please sign up or login with your details

Forgot password? Click here to reset