eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2010-07-15
10171
1
18
10.4230/DagSemProc.10171.1
article
10171 Abstracts Collection – Equilibrium Computation
Elkind, Edith
Megiddo, Nimrod
Miltersen, Peter Bro
von Stengel, Bernhard
Vazirani, Vijay V.
From April 25 to April 30, 2010, the Dagstuhl Seminar 10171 ``Equilibrium Computation'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10171/DagSemProc.10171.1/DagSemProc.10171.1.pdf
Equilibrium computation
algorithmic game theory
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2010-07-15
10171
1
19
10.4230/DagSemProc.10171.2
article
Improved Algorithms for Computing Fisher's Market Clearing Prices
Orlin, James B.
We give the first strongly polynomial time algorithm for computing
an equilibrium for the linear utilities case of Fisher's market model.
We consider a problem with a set $B$ of buyers and a set $G$ of divisible goods.
Each buyer $i$ starts with an initial integral allocation
$e_i$ of money. The integral utility for buyer $i$ of
good $j$ is $U_{ij}$. We first develop a weakly polynomial
time algorithm that runs in $O(n^4 log U_{max} + n^3 e_{max})$ time, where
$n = |B| + |G|$. We further modify the algorithm so that it runs
in $O(n^4 log n)$ time. These algorithms improve upon the
previous best running time of
$O(n^8 log U_{max} + n^7 log e_{max})$, due to Devanur et al.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10171/DagSemProc.10171.2/DagSemProc.10171.2.pdf
Market equilibrium
Fisher
strongly polynomial
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2010-07-15
10171
1
6
10.4230/DagSemProc.10171.3
article
Proportional Response as Iterated Cobb-Douglas
Todd, Michael J.
We show that the proportional response algorithm for computing an
economic equilibrium in a Fisher market model can be interpreted as
iteratively approximating the economy by one with Cobb-Douglas
utilities, for which a closed-form equilibrium can be obtained.
We also extend the method to allow elasticities of substitution at
most one.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10171/DagSemProc.10171.3/DagSemProc.10171.3.pdf
Computing equilibria
Fisher market
proportional response algorithm
Cobb-Douglas utilities