The Complexity of Computing a Competitive Equilibrium in Fisher Markets with Chores
cs.GT
Submitted: 2026-11-08
Updated: 2026-11-08
Terminology
Sources
- Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness
- Computing Competitive Equilibrium for Chores: Linear Convergence and Lightweight Iteration
- Competitive Equilibrium in Labor Economies through the Lens of Goods and Chores Fisher Markets
- Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm
- Fully Distributed T\^atonnement for Chores Markets
- Competitive Equilibrium for Linear Chores is CLS-complete
Related papers
- How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation
- Effective Horizons for Prophet Inequalities with Discounted I.I.D. Rewards
- Truthful-in-Expectation Mechanism with Constant Maximin-Share Guarantee
- The Power of Recruiting the Smaller Side: Two Additional Traders Suffice in Two-Sided Markets
- From signaling to interviews in random matching markets
- Optimizing Social Utility in Sequential Experiments