Possible and Necessary Allocations via Sequential Mechanisms

12/06/2014
by   Haris Aziz, et al.
0

A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or all mechanisms for several commonly used classes of sequential allocation mechanisms. In particular, we consider whether a given agent receives a given item, a set of items, or a subset of items for five natural classes of sequential allocation mechanisms: balanced, recursively balanced, balanced alternating, strictly alternating and all policies. We identify characterizations of allocations produced balanced, recursively balanced, balanced alternating policies and strictly alternating policies respectively, which extend the well-known characterization by Brams and King [2005] for policies without restrictions. In addition, we examine the computational complexity of possible and necessary allocation problems for these classes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2015

Welfare of Sequential Allocation Mechanisms for Indivisible Goods

Sequential allocation is a simple and attractive mechanism for the alloc...
research
04/22/2013

A Social Welfare Optimal Sequential Allocation Procedure

We consider a simple sequential allocation procedure for sharing indivis...
research
09/05/2021

Balanced House Allocation

We introduce balancedness a fairness axiom in house allocation problems....
research
04/22/2015

Allocating Indivisible Items in Categorized Domains

We formulate a general class of allocation problems called categorized d...
research
06/29/2020

Expected Outcomes and Manipulations in Online Fair Division

Two simple and attractive mechanisms for the fair division of indivisibl...
research
02/17/2023

Contests as Optimal Mechanisms under Signal Manipulation

We study the distribution of multiple homogeneous items to multiple agen...
research
09/10/2023

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach

In this paper we study a resource allocation problem that encodes correl...

Please sign up or login with your details

Forgot password? Click here to reset