Quality of local equilibria in discrete exchange economies
From MaRDI portal
Publication:2178594
Abstract: This paper defines the notion of a local equilibrium of quality , , in a discrete exchange economy: a partial allocation and item prices that guarantee certain stability properties parametrized by the numbers and . The quality measures the fit between the allocation and the prices: the larger and the closer the fit. For this notion provides a graceful degradation for the conditional equilibria of [10] which are exactly the local equilibria of quality . For the local equilibria of quality are {em more stable} than conditional equilibria. Any local equilibrium of quality provides, without any assumption on the type of the agents' valuations, an allocation whose value is at least the optimal fractional allocation. In any economy in which all agents' valuations are -submodular, i.e., exhibit complementarity bounded by , there is a local equilibrium of quality . In such an economy any greedy allocation provides a local equilibrium of quality . Walrasian equilibria are not amenable to such graceful degradation.
Recommendations
Cites work
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- An analysis of approximations for maximizing submodular set functions—I
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Bayesian combinatorial auctions
- Combinatorial auctions via posted prices
- Combinatorial auctions with decreasing marginal utilities
- Combinatorial auctions with endowment effect
- Competitive equilibrium in an exchange economy with indivisibilities
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
- Equilibria and Indivisibilities: Gross Substitutes and Complements
- Existence of Competitive Equilibria in Markets with a Continuum of Traders
- Existence of an Equilibrium for a Competitive Economy
- Job Matching, Coalition Formation, and Gross Substitutes
- On maximizing welfare when utility functions are subadditive
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- The communication complexity of local search
- Truth revelation in approximately efficient combinatorial auctions
- Walrasian equilibrium with gross substitutes
Cited in
(5)
This page was built for publication: Quality of local equilibria in discrete exchange economies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178594)