Competitive equilibrium with indivisible goods and generic budgets
From MaRDI portal
Abstract: Competitive equilibrium from equal incomes (CEEI) is a classic solution to the problem of fair and efficient allocation of goods [Foley'67, Varian'74]. Every agent receives an equal budget of artificial currency with which to purchase goods, and prices match demand and supply. However, a CEEI is not guaranteed to exist when the goods are indivisible, even in the simple two-agent, single-item market. Yet, it is easy to see that once the two budgets are slightly perturbed (made generic), a competitive equilibrium does exist. In this paper we aim to extend this approach beyond the single-item case, and study the existence of equilibria in markets with two agents and additive preferences over multiple items. We show that for agents with equal budgets, making the budgets generic -- by adding vanishingly small random perturbations -- ensures the existence of an equilibrium. We further consider agents with arbitrary non-equal budgets, representing non-equal entitlements for goods. We show that competitive equilibrium guarantees a new notion of fairness among non-equal agents, and that it exists in cases of interest (like when the agents have identical preferences) if budgets are perturbed. Our results open opportunities for future research on generic equilibrium existence and fair treatment of non-equals.
Recommendations
Cites work
- Almost envy-freeness with general valuations
- Approximating the Nash social welfare with budget-additive valuations
- Approximating the Nash Social Welfare with Indivisible Items
- Characterization and computation of equilibria for indivisible goods
- Competitive equilibria for non-quasilinear bidders in combinatorial auctions
- Competitive equilibria with indivisible goods
- Dissolving a Partnership Efficiently
- Dividing bads under additive utilities
- Equilibrium Analysis of Exchange Economies with Indivisible Commodities
- Existence of an Equilibrium for a Competitive Economy
- Fair Allocation of Indivisible Goods
- Fair Allocation of Indivisible Goods and Criteria of Justice
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Fair assignment of indivisible objects under ordinal preferences
- Fair enough: guaranteeing approximate maximin shares
- Handbook of Computational Social Choice
- scientific article; zbMATH DE number 1234106 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- Indivisible commodities and general equilibrium theory
- Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
- Microeconomic theory
- Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
- On cores and indivisibility
- On profit-maximizing envy-free pricing
- On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
- On the complexity of price equilibria
- Proportional pie-cutting
Cited in
(26)- Competitive equilibrium with equal incomes for allocation of indivisible objects
- Picking sequences and monotonicity in weighted fair division
- Mind the gap: cake cutting with separation
- Utility-refined and budget-refined \(\varepsilon\)-competitive equilibria
- Foundations of pseudomarkets: Walrasian equilibria for discrete resources
- Democratic fair allocation of indivisible goods
- Dividing bads under additive utilities
- Approximate competitive equilibrium with generic budget
- On maximum weighted Nash welfare for binary valuations
- Characterization and computation of equilibria for indivisible goods
- Welfare and revenue guarantees for competitive bundling equilibrium
- Ordinal Maximin Share Approximation for Goods
- Efficient Fair Division with Minimal Sharing
- Fair division of indivisible goods: recent progress and open questions
- Envy-free matchings in bipartite graphs and their applications to fair division
- Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness
- Almost proportional allocations of indivisible chores: computation, approximation and efficiency
- Weighted fair division of indivisible items: a review
- Fair division with two-sided preferences
- Weighted envy-freeness for submodular valuations
- Asymptotic analysis of weighted fair division
- Does carrier collaboration require combinatorial auctions?
- Fair and truthful allocations under leveled valuations
- Fair division with interdependent values
- Fair division with interdependent values
- Endogenous budget constraints in the assignment game
This page was built for publication: Competitive equilibrium with indivisible goods and generic budgets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4991681)