Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Auction algorithms for market equilibrium
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear Utilities
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Leontief economies encode nonzero sum two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the complexity of market equilibria with maximum social welfare
Information Processing Letters
Computing Nash Equilibria: Approximation and Smoothed Complexity
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
A path to the Arrow–Debreu competitive market equilibrium
Mathematical Programming: Series A and B
On the approximation and smoothed complexity of Leontief market equilibria
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Tatonnement in ongoing markets of complementary goods
Proceedings of the 13th ACM Conference on Electronic Commerce
Hi-index | 5.23 |
We introduce a new family of utility functions for exchange markets. This family provides a natural and ''continuous'' hybridization of the traditional linear and Leontief utilities and might be useful in understanding the complexity of computing approximating market equilibria, although computing an equilibrium in a market with this family of utility functions, this is PPAD-hard in general. In this paper, we present an algorithm for finding an approximate Arrow-Debreu equilibrium when the Leontief components of the market are grouped, finite and well-conditioned.