Walrasian's characterization and a universal ascending auction
From MaRDI portal
Publication:2013362
Abstract: We introduce a novel characterization of all Walrasian price vectors in terms of forbidden over- and under demanded sets for monotone gross substitute combinatorial auctions. For ascending and descending auctions we suggest a universal framework for finding the minimum or maximum Walrasian price vectors for monotone gross substitute combinatorial auctions. An ascending (descending) auction is guaranteed to find the minimum (maximum) Walrasian if and only if it follows the suggested framework.
Recommendations
- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
- Ascending price Vickrey auctions for general valuations
- Equilibrium, auction, and generalized gross substitutes and complements
- Sets in excess demand in simple ascending auctions with unit-demand bidders
- Combinatorial Walrasian equilibrium
Cites work
- scientific article; zbMATH DE number 3084780 (Why is no real title available?)
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Ascending price Vickrey auctions for general valuations
- Characterization of the Walrasian equilibria of the assignment model
- Combinatorial auctions
- Combinatorial auctions with decreasing marginal utilities
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Competitive equilibrium in an exchange economy with indivisibilities
- Discrete Convex Analysis
- Gross substitutability: an algorithmic survey
- Informational limitations of ascending combinatorial auctions
- Job Matching, Coalition Formation, and Gross Substitutes
- On Representatives of Subsets
- On ascending Vickrey auctions for heterogeneous objects
- Sets in excess demand in simple ascending auctions with unit-demand bidders
- The English auction with differentiated commodities
- Verifying gross substitutability.
- Walrasian equilibrium with gross substitutes
Cited in
(6)- Characterization of the Walrasian equilibria of the assignment model
- Sets in excess demand in simple ascending auctions with unit-demand bidders
- A flow-based ascending auction to compute buyer-optimal Walrasian prices
- The finite matroid-based valuation conjecture is false
- Social welfare in search games with asymmetric information
- On the construction of substitutes
This page was built for publication: Walrasian's characterization and a universal ascending auction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013362)