On the complexity of price equilibria
From MaRDI portal
Publication:1886458
DOI10.1016/S0022-0000(03)00011-4zbMath1067.90102OpenAlexW2029136172MaRDI QIDQ1886458
Christos H. Papadimitriou, Xiaotie Deng, Shmuel Safra
Publication date: 18 November 2004
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00011-4
Related Items (14)
Characterization and Computation of Equilibria for Indivisible Goods ⋮ Quantum separation of local search and fixed point computation ⋮ Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality ⋮ A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property ⋮ Approximate competitive equilibrium with generic budget ⋮ Recent development in computational complexity characterization of Nash equilibrium ⋮ A primal-dual algorithm for the computation of market equilibrium with logarithmic utility functions ⋮ Proportional response dynamics in the Fisher market ⋮ Approximation of Walrasian equilibrium in single-minded auctions ⋮ Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses ⋮ Competitive Equilibrium with Indivisible Goods and Generic Budgets ⋮ On the complexity of market equilibria with maximum social welfare ⋮ Structure and complexity of extreme Nash equilibria ⋮ Condorcet winners for public goods
Cites Work
- Equilibrium in a discrete exchange economy with money
- The competitive allocation process is informationally efficient uniquely
- On the complexity of the parity argument and other inefficient proofs of existence
- On cores and indivisibility
- Algorithms, games, and the internet
- Existence of an Equilibrium for a Competitive Economy
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of price equilibria
