DMCA
Auction Algorithms for Market Equilibrium (2004)
Cached
Download Links
| Venue: | STOC 2004 |
| Citations: | 49 - 6 self |
BibTeX
@MISC{Garg04auctionalgorithms,
author = {Rahul Garg and Sanjiv Kapoor},
title = {Auction Algorithms for Market Equilibrium},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we study algorithms for computing market equilibrium in markets with linear utility functions. The buyers in the market have an initial endowment given by a portfolio of items. The market equilibrium problem is to compute a price vector which ensures market clearing, i.e. the demand of a good equals its supply, and given the prices, each buyer maximizes its utility. The problem is of considerable interest in Economics. This paper presents a formulation of the market equilibrium problem as a parameterized linear program. We construct the dual of these parametrized linear programs. We show that finding the market equilibrium is the same as finding a linear-program from the family of programs where the optimal dual solution satisfies certain properties. The market clearing conditions arise naturally from complementary slackness conditions. We then define an auction mechanism which computes prices such that approximate market clearing is achieved. The algorithm we obtain outperforms previously known methods.
Keyphrases
market equilibrium auction algorithm market equilibrium problem market clearing price vector linear program linear utility function good equal considerable interest auction mechanism complementary slackness condition initial endowment parameterized linear program market clearing condition
