Eisenberg–Gale markets: Algorithms and game-theoretic properties

We define a new class of markets, the Eisenberg–Gale markets. This class contains Fisher's linear market, markets from the resource allocation framework of Kelly [Kelly, F.P., 1997. Charging and rate control for elastic traffic. Europ. Transactions Telecommunications 8, 33–37], as well as numer...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Games and economic behavior Ročník 70; číslo 1; s. 84 - 106
Hlavní autoři: Jain, Kamal, Vazirani, Vijay V.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.09.2010
Elsevier
Edice:Games and Economic Behavior
Témata:
Ascending price auctions
Auctions
Combinatorial algorithm
Competition monotonicity
Convex program
Equilibrium models
Equilibrium theory
Fairness
Fisher market model
General economic equilibrium
General equilibrium theory
General equilibrium theory Fisher market model Combinatorial algorithm Primal-dual algorithm Convex program Resource allocation Ascending price auctions Weak gross substitutability Competition monotonicity Fairness
Market theory
Price theory
Primal-dual algorithm
Resource allocation
Weak gross substitutability
C63
General equilibrium theory
Primal-dual algorithm
C68
Ascending price auctions
Fisher market model
Combinatorial algorithm
Resource allocation
Fairness
Competition monotonicity
Convex program
C62
Weak gross substitutability
ISSN:0899-8256, 1090-2473
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We define a new class of markets, the Eisenberg–Gale markets. This class contains Fisher's linear market, markets from the resource allocation framework of Kelly [Kelly, F.P., 1997. Charging and rate control for elastic traffic. Europ. Transactions Telecommunications 8, 33–37], as well as numerous interesting new markets. We obtain combinatorial, strongly polynomial algorithms for several markets in this class. Our algorithms have a simple description as ascending price auctions. Our algorithms lead to insights into game-theoretic properties of these markets, such as efficiency, fairness, and competition monotonicity. They also help determine if these markets always have rational equilibria. A classification of Eisenberg–Gale markets w.r.t. these properties reveals a surprisingly rich set of possibilities.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0899-8256
1090-2473
DOI:10.1016/j.geb.2008.11.011