A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
Ran Duan, Kurt Mehlhorn
TL;DR
This paper introduces the first combinatorial polynomial-time algorithm for computing market equilibria in the Arrow-Debreu model with linear utilities, advancing computational economics.
Contribution
It provides a novel combinatorial approach that efficiently computes market equilibria, improving upon previous methods that relied on less efficient algorithms.
Findings
Algorithm runs in polynomial time
Successfully computes equilibria for linear utility markets
Establishes a new computational method for economic models
Abstract
We present the first combinatorial polynomial time algorithm for computing the equilibrium of the Arrow-Debreu market model with linear utilities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Economic theories and models · Game Theory and Voting Systems