Log In Sign Up

Combinatorial Algorithms for General Linear Arrow-Debreu Markets

by   Bhaskar Ray Chaudhury, et al.

We present a combinatorial algorithm for determining the market clearing prices of a general linear Arrow-Debreu market, where every agent can own multiple goods. The existing combinatorial algorithms for linear Arrow-Debreu markets consider the case where each agent can own all of one good only. We present an Õ((n+m)^7 ^3(UW)) algorithm where n, m, U and W refer to the number of agents, the number of goods, the maximal integral utility and the maximum quantity of any good in the market respectively. The algorithm refines the iterative algorithm of Duan, Garg and Mehlhorn using several new ideas. We also identify the hard instances for existing combinatorial algorithms for linear Arrow-Debreu markets. In particular we find instances where the ratio of the maximum to the minimum equilibrium price of a good is U^Ω(n) and the number of iterations required by the existing iterative combinatorial algorithms of Duan, and Mehlhorn and Duan, Garg, and Mehlhorn are high. Our instances also separate the two algorithms.


page 1

page 2

page 3

page 4


An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibrium

Motivated by the convergence of mirror-descent algorithms to market equi...

Designing a Combinatorial Financial Options Market

Financial options are contracts that specify the right to buy or sell an...

Reputation and Pricing Dynamics in Online Markets

We study the economic interactions among sellers and buyers in online ma...

Combinatorial Modelling and Learning with Prediction Markets

Combining models in appropriate ways to achieve high performance is comm...

Price Updating in Combinatorial Prediction Markets with Bayesian Networks

To overcome the #P-hardness of computing/updating prices in logarithm ma...

Isoelastic Agents and Wealth Updates in Machine Learning Markets

Recently, prediction markets have shown considerable promise for develop...

Design and Analysis of a Synthetic Prediction Market using Dynamic Convex Sets

We present a synthetic prediction market whose agent purchase logic is d...