Time bounds for iterative auctions: a unified approach by discrete convex analysis
From MaRDI portal
Publication:1751147
DOI10.1016/j.disopt.2016.01.001zbMath1390.91149OpenAlexW2267133450MaRDI QIDQ1751147
Kazuo Murota, Zaifu Yang, Akiyoshi Shioura
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2016.01.001
submodular functiondiscrete optimizationWalrasian equilibriumdiscrete convex functioniterative auction
Convex programming (90C25) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
Independence systems in gross-substitute valuations, Note on time bounds of two-phase algorithms for \(L\)-convex function minimization, Walrasian equilibria from an optimization perspective: A guide to the literature, Discrete Midpoint Convexity, Equivalence between substitutability and \(\mathrm{M}^\natural\)-concavity for set functions under discrete transfers, Simpler exchange axioms for M-concave functions on generalized polymatroids, Directed discrete midpoint convexity, The discrete separation theorem and price adjustment directions in markets with heterogeneous commodities
Cites Work
- Unnamed Item
- Unnamed Item
- Convexity and Steinitz's exchange property
- Substitute goods, auctions, and equilibrium
- Multi-item Vickrey-Dutch auctions
- Walrasian equilibrium with gross substitutes
- On a dynamic auction mechanism for a bilateral assignment problem
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
- The English auction with differentiated commodities
- Exact bounds for steepest descent algorithms of $L$-convex function minimization
- Multi-item Vickrey-English-Dutch auctions
- Sets in excess demand in simple ascending auctions with unit-demand bidders
- Combinatorial auctions with decreasing marginal utilities
- Submodular functions and optimization.
- M-Convex Function on Generalized Polymatroid
- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
- A Double-Track Adjustment Process for Discrete Markets With Substitutes and Complements
- Job Matching, Coalition Formation, and Gross Substitutes
- Discrete Convex Analysis
- On Steepest Descent Algorithms for Discrete Convex Functions
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- A Note on Kelso and Crawford's Gross Substitutes Condition
