Most Competitive Mechanisms in Online Fair Division

06/29/2020
by   Martin Aleksandrov, et al.
0

This paper combines two key ingredients for online algorithms - competitive analysis (e.g. the competitive ratio) and advice complexity (e.g. the number of advice bits needed to improve online decisions) - in the context of a simple online fair division model where items arrive one by one and are allocated to agents via some mechanism. We consider four such online mechanisms: the popular Ranking matching mechanism adapted from online bipartite matching and the Like, Balanced Like and Maximum Like allocation mechanisms firstly introduced for online fair division problems. Our first contribution is that we perform a competitive analysis of these mechanisms with respect to the expected size of the matching, the utilitarian welfare, and the egalitarian welfare. We also suppose that an oracle can give a number of advice bits to the mechanisms. Our second contribution is to give several impossibility results; e.g. no mechanism can achieve the egalitarian outcome of the optimal offline mechanism supposing they receive partial advice from the oracle. Our third contribution is that we quantify the competitive performance of these four mechanisms w.r.t. the number of oracle requests they can make. We thus present a most-competitive mechanism for each objective.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2015

Online Fair Division: analysing a Food Bank problem

We study an online model of fair division designed to capture features o...
research
06/29/2020

Strategy-proofness, Envy-freeness and Pareto efficiency in Online Fair Division with Additive Utilities

We consider fair division problems where indivisible items arrive one-by...
research
06/29/2020

Expected Outcomes and Manipulations in Online Fair Division

Two simple and attractive mechanisms for the fair division of indivisibl...
research
05/14/2018

Prophets and Secretaries with Overbooking

The prophet and secretary problems demonstrate online scenarios involvin...
research
10/18/2017

Deceased Organ Matching in Australia

Despite efforts to increase the supply of organs from living donors, mos...
research
11/03/2022

Truthful Matching with Online Items and Offline Agents

We study truthful mechanisms for welfare maximization in online bipartit...
research
04/09/2021

Sequential Online Chore Division for Autonomous Vehicle Convoy Formation

Chore division is a class of fair division problems in which some undesi...

Please sign up or login with your details

Forgot password? Click here to reset