English
Related papers

Related papers: Settling the Complexity of Arrow-Debreu Equilibria…

200 papers

We introduce the notion of non-monotone utilities, which covers a wide variety of utility functions in economic theory. We then prove that it is PPAD-hard to compute an approximate Arrow-Debreu market equilibrium in markets with linear and…

Computational Complexity · Computer Science 2012-11-22 Xi Chen , Dimitris Paparas , Mihalis Yannakakis

It is a common belief that computing a market equilibrium in Fisher's spending model is easier than computing a market equilibrium in Arrow-Debreu's exchange model. This belief is built on the fact that we have more algorithmic success in…

Computer Science and Game Theory · Computer Science 2009-07-24 Xi Chen , Shang-Hua Teng

We study the problem of computing approximate market equilibria in Fisher markets with separable piecewise-linear concave (SPLC) utility functions. In this setting, the problem was only known to be PPAD-complete for inverse-polynomial…

Computer Science and Game Theory · Computer Science 2026-05-12 Argyrios Deligkas , John Fearnley , Alexandros Hollender , Themistoklis Melissourgos

Although production is an integral part of the Arrow-Debreu market model, most of the work in theoretical computer science has so far concentrated on markets without production, i.e., the exchange economy. This paper takes a significant…

Computer Science and Game Theory · Computer Science 2013-09-24 Jugal Garg , Vijay V. Vazirani

We study the equilibrium computation problem in the Fisher market model with constrained piecewise linear concave (PLC) utilities. This general class captures many well-studied special cases, including markets with PLC utilities, markets…

Computer Science and Game Theory · Computer Science 2021-07-14 Jugal Garg , Yixin Tao , László A. Végh

We present the first combinatorial polynomial time algorithm for computing the equilibrium of the Arrow-Debreu market model with linear utilities.

Data Structures and Algorithms · Computer Science 2014-03-25 Ran Duan , Kurt Mehlhorn

We design a simple ascending-price algorithm to compute a $(1+\varepsilon)$-approximate equilibrium in Arrow-Debreu exchange markets with weak gross substitute (WGS) property, which runs in time polynomial in market parameters and $\log…

Computer Science and Game Theory · Computer Science 2016-05-31 Xiaohui Bei , Jugal Garg , Martin Hoefer

Recent results, establishing evidence of intractability for such restrictive utility functions as additively separable, piecewise-linear and concave, under both Fisher and Arrow-Debreu market models, have prompted the question of whether we…

Computer Science and Game Theory · Computer Science 2010-10-21 Vijay V. Vazirani

We present a strongly polynomial algorithm for computing an equilibrium in Arrow-Debreu exchange markets with linear utilities. Our algorithm is based on a variant of the weakly-polynomial Duan-Mehlhorn (DM) algorithm. We use the DM…

Data Structures and Algorithms · Computer Science 2022-02-03 Jugal Garg , László A. Végh

We present the first analysis of Fisher markets with buyers that have budget-additive utility functions. Budget-additive utilities are elementary concave functions with numerous applications in online adword markets and revenue optimization…

Computer Science and Game Theory · Computer Science 2016-05-03 Xiaohui Bei , Jugal Garg , Martin Hoefer , Kurt Mehlhorn

This paper resolves two of the handful of remaining questions on the computability of market equilibria, a central theme within algorithmic game theory (AGT). Our results are as follows: 1. We show FIXP-hardness of computing equilibria in…

Computational Complexity · Computer Science 2020-05-22 Jugal Garg , Ruta Mehta , Vijay V. Vazirani , Sadra Yazdanbod

The Arrow-Debreu extension of the classic Hylland-Zeckhauser scheme for a one-sided matching market -- called ADHZ in this paper -- has natural applications but has instances which do not admit equilibria. By introducing approximation, we…

Computer Science and Game Theory · Computer Science 2021-07-22 Jugal Garg , Thorben Tröbst , Vijay V. Vazirani

We present an improved combinatorial algorithm for the computation of equilibrium prices in the linear Arrow-Debreu model. For a market with $n$ agents and integral utilities bounded by $U$, the algorithm runs in $O(n^7 \log^3 (nU))$ time.…

Data Structures and Algorithms · Computer Science 2015-10-19 Rann Duan , Jugal Garg , Kurt Mehlhorn

Motivated by the convergence result of mirror-descent algorithms to market equilibria in linear Fisher markets, it is natural for one to consider designing dynamics (specifically, iterative algorithms) for agents to arrive at linear…

Computer Science and Game Theory · Computer Science 2020-03-13 Po-An Chen , Chi-Jen Lu , Yu-Sin Lu

In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, in which each trader's utility may be influenced by the…

Computer Science and Game Theory · Computer Science 2010-09-03 Xi Chen , Shang-Hua Teng

We prove that the classic problem of finding a competitive equilibrium in an exchange economy with indivisible goods, money, and unit-demand agents is PPAD-complete. In this "housing market", agents have preferences over the house and…

Computer Science and Game Theory · Computer Science 2024-02-22 Edwin Lock , Zephyr Qiu , Alexander Teytelboym

We settle a long-standing open question in algorithmic game theory. We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD Polynomial Parity Argument, Directed…

Computer Science and Game Theory · Computer Science 2007-05-23 Xi Chen , Xiaotie Deng , Shang-Hua Teng

Under risk, Arrow-Debreu equilibria can be implemented as Radner equilibria by continuous trading of few long-lived securities. We show that this result generically fails if there is Knightian uncertainty in the volatility. Implementation…

Mathematical Finance · Quantitative Finance 2014-09-25 Patrick Beissner , Frank Riedel

We derive tractable necessary and sufficient conditions for the absence of buy-and-hold arbitrage opportunities in a perfectly liquid, one period market. We formulate the positivity of Arrow-Debreu prices as a generalized moment problem to…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 Alexandre d'Aspremont

We give a new, flow-type convex program describing equilibrium solutions to linear Arrow-Debreu markets. Whereas convex formulations were previously known [Nenakov, Primak 83; Jain 07; Cornet '89], our program exhibits several new features.…

Data Structures and Algorithms · Computer Science 2013-11-13 Nikhil R. Devanur , Jugal Garg , László A. Végh
‹ Prev 1 2 3 10 Next ›