DeepAI
Log In Sign Up

An Optimal Procedure to Check Pareto-Optimality in House Markets with Single-Peaked Preferences

02/14/2020
by   Aurélie Beynier, et al.
0

Recently, the problem of allocating one resource per agent with initial endowments (house markets) has seen a renewed interest: indeed, while in the domain of strict preferences the Top Trading Cycle algorithm is known to be the only procedure guaranteeing Pareto-optimality, individual rationality, and strategy proofness. However, the situation differs in the single-peaked domain. Indeed, Bade presented the Crawler, an alternative procedure enjoying the same properties, with the additional advantage of being implementable in obviously dominant strategies. In this paper we further investigate the Crawler and propose the Diver, a variant which checks optimally whether an allocation is Pareto-optimal for single-peaked preferences, thus improving over known techniques used for checking Pareto-optimality in more general domains. We also prove that the Diver is asymptotically optimal in terms of communication complexity.

READ FULL TEXT
06/24/2019

House Markets and Single-Peaked Preferences: From Centralized to Decentralized Allocation Procedures

Recently, the problem of allocating one resource per agent with initial ...
02/08/2020

Fairness and Efficiency in Cake-Cutting with Single-Peaked Preferences

We study the cake-cutting problem when agents have single-peaked prefere...
07/03/2016

Can we reach Pareto optimal outcomes using bottom-up approaches?

Traditionally, researchers in decision making have focused on attempting...
05/26/2019

Strategyproof Multi-Item Exchange Under Single-Minded Dichotomous Preferences

We consider multi-item exchange markets in which agents want to receive ...
04/01/2021

Pareto optimal exchange with indifferent endowments

We investigate a market without money in which agents can offer certain ...
01/20/2019

Pareto optimal coalitions of fixed size

We tackle the problem of partitioning players into groups of fixed size,...
10/16/2015

Bad Universal Priors and Notions of Optimality

A big open question of algorithmic information theory is the choice of t...