Reforming an Envy-Free Matching

07/06/2022
by   Takehiro Ito, et al.
0

We consider the problem of reforming an envy-free matching when each agent is assigned a single item. Given an envy-free matching, we consider an operation to exchange the item of an agent with an unassigned item preferred by the agent that results in another envy-free matching. We repeat this operation as long as we can. We prove that the resulting envy-free matching is uniquely determined up to the choice of an initial envy-free matching, and can be found in polynomial time. We call the resulting matching a reformist envy-free matching, and then we study a shortest sequence to obtain the reformist envy-free matching from an initial envy-free matching. We prove that a shortest sequence is computationally hard to obtain even when each agent accepts at most four items and each item is accepted by at most three agents. On the other hand, we give polynomial-time algorithms when each agent accepts at most three items or each item is accepted by at most two agents. Inapproximability and fixed-parameter (in)tractability are also discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/21/2022

On Reachable Assignments under Dichotomous Preferences

We consider the problem of determining whether a target item assignment ...
research
05/16/2022

Efficient Nearly-Fair Division with Capacity Constraints

We consider the problem of fairly and efficiently matching agents to ind...
research
09/15/2019

Algorithms for Manipulating Sequential Allocation

Sequential allocation is a simple and widely studied mechanism to alloca...
research
02/17/2022

A novel HD Computing Algebra: Non-associative superposition of states creating sparse bundles representing order information

Information inflow into a computational system is by a sequence of infor...
research
08/24/2023

A note on solving the envy-free perfect matching problem with qualities of items

In the envy-free perfect matching problem, n items with unit supply are ...
research
10/27/2021

Mechanisms for Trading Durable Goods

We consider trading indivisible and easily transferable durable goods, w...
research
05/11/2021

Rearrangement on Lattices with Pick-n-Swaps: Optimality Structures and Efficient Algorithms

We investigate a class of multi-object rearrangement problems in which a...

Please sign up or login with your details

Forgot password? Click here to reset