Optimization-friendly generic mechanisms without money

06/14/2021
by   Mark Braverman, et al.
0

The goal of this paper is to develop a generic framework for converting modern optimization algorithms into mechanisms where inputs come from self-interested agents. We focus on aggregating preferences from n players in a context without money. Special cases of this setting include voting, allocation of items by lottery, and matching. Our key technical contribution is a new meta-algorithm we call (Adaptive Pricing Equalizing Externalities). The framework is sufficiently general to be combined with any optimization algorithm that is based on local search. We outline an agenda for studying the algorithm's properties and its applications. As a special case of applying the framework to the problem of one-sided assignment with lotteries, we obtain a strengthening of the 1979 result by Hylland and Zeckhauser on allocation via a competitive equilibrium from equal incomes (CEEI). The [HZ79] result posits that there is a (fractional) allocation and a set of item prices such that the allocation is a competitive equilibrium given prices. We further show that there is always a reweighing of the players' utility values such that running unit-demand VCG with reweighed utilities leads to a HZ-equilibrium prices. Interestingly, not all HZ competitive equilibria come from VCG prices. As part of our proof, we re-prove the [HZ79] result using only Brouwer's fixed point theorem (and not the more general Kakutani's theorem). This may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2018

Local optima, local equilibria and bounded complementarity in discrete exchange economies

In a discrete exchange economy an allocation is a local optimum if no tr...
research
11/22/2019

Competitive Equilibrium with Generic Budgets: Beyond Additive

We study competitive equilibrium in the canonical Fisher market model, b...
research
09/16/2019

Solving Strong-Substitutes Product-Mix Auctions

This paper develops algorithms to solve strong-substitutes product-mix a...
research
05/23/2022

Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness

We study the computational complexity of finding a competitive equilibri...
research
01/03/2023

The Price of Anarchy in One-Sided Allocation Problems with Multi-Unit Demand Agents

We study the one-sided allocation problem with multi-unit demand agents....
research
12/03/2018

Optimal Resource Allocation over Networks via Lottery-Based Mechanisms

We show that, in a resource allocation problem, the ex ante aggregate ut...
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 ...

Please sign up or login with your details

Forgot password? Click here to reset