An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms

09/22/2020
by   Jugal Garg, et al.
0

The Arrow-Debreu extension of the classic Hylland-Zeckhauser scheme for a one-sided matching market – called ADHZ in this paper – has natural applications but has instances which do not admit equilibria. By introducing approximation, we define the ϵ-approximate ADHZ model. We give the following results. * Existence of equilibrium for the ϵ-approximate ADHZ model under linear utility functions. The equilibrium satisfies Pareto optimality, approximate envy-freeness and incentive compatibility in the large. * A combinatorial polynomial time algorithm for an ϵ-approximate ADHZ equilibrium for the case of dichotomous, and more generally bi-valued, utilities. * An instance of ADHZ, with dichotomous utilities and a strongly connected demand graph, which does not admit an equilibrium. * A rational convex program for HZ under dichotomous utilities; a combinatorial polynomial time algorithm for this case was given by Vazirani and Yannakakis (2020). The ϵ-approximate ADHZ model fills a void, described in the paper, in the space of general mechanisms for one-sided matching markets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2021

Nash-Bargaining-Based Models for Matching Markets, with Implementations and Experimental Results

This paper addresses the paucity of models of matching markets, both one...
research
04/03/2020

Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets

In 1979, Hylland and Zeckhauser <cit.> gave a simple and general scheme ...
research
07/12/2021

Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets

We study the equilibrium computation problem in the Fisher market model ...
research
07/12/2021

Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores

Competitive equilibrium with equal income (CEEI) is considered one of th...
research
05/24/2020

Walrasian Equilibria in Markets with Small Demands

We study the complexity of finding a Walrasian equilibrium in markets wh...
research
09/17/2018

A Strongly Polynomial Algorithm for Linear Exchange Markets

We present a strongly polynomial algorithm for computing an equilibrium ...
research
03/24/2023

Dynamic Combinatorial Assignment

We study a model of dynamic combinatorial assignment of indivisible obje...

Please sign up or login with your details

Forgot password? Click here to reset