A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property

We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross substitutability property. The motivation for this comes from the work of Kelly, Maulloo, and Tan [F.P. Kelly, A.K. Maulloo, D.K.H. T...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 378; číslo 2; s. 143 - 152
Hlavní autoři:	Garg, Dinesh, Jain, Kamal, Talwar, Kunal, Vazirani, Vijay V.
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 06.06.2007 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorial algorithm Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Computing market equilibria Exact sciences and technology Fisher equilibrium Graph theory Gross substitutability property Mathematics Miscellaneous Primal-dual algorithm Programming theory Sciences and techniques of general use Strongly polynomial time exact algorithm Theoretical computing Computing market equilibria Primal-dual algorithm Strongly polynomial time exact algorithm Gross substitutability property Fisher equilibrium Combinatorial algorithm Polynomial Computer theory Node Research Computing Communication network Knowledge Equilibrium Convex programming Flow Polynomial time Maximum Tree Numerical stability Communication
ISSN:	0304-3975, 1879-2294
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!

Buďte první, kdo okomentuje tento záznam!