Time bounds for iterative auctions: a unified approach by discrete convex analysis
type: Item
instance of: scholarly article
title: Time bounds for iterative auctions: a unified approach by discrete convex analysis
zbMATH Open document ID: 1390.91149
author: Kazuo Murota
author: Akiyoshi Shioura
author: Zaifu Yang
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 91B26
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6872075
zbMATH Keywords: discrete optimization
zbMATH Keywords: submodular function
zbMATH Keywords: discrete convex function
zbMATH Keywords: Walrasian equilibrium
zbMATH Keywords: iterative auction
MaRDI profile type: Publication
full work available at URL: j.disopt.2016.01.001
OpenAlex ID: W2267133450
cites work: Q3524720
cites work: Q3588651
cites work: Walrasian equilibrium with gross substitutes
cites work: The English auction with differentiated commodities
cites work: Job Matching, Coalition Formation, and Gross Substitutes
cites work: Substitute goods, auctions, and equilibrium
cites work: Multi-item Vickrey-English-Dutch auctions
cites work: On a dynamic auction mechanism for a bilateral assignment problem
cites work: A Note on Kelso and Crawford's Gross Substitutes Condition
cites work: New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
cites work: Sets in excess demand in simple ascending auctions with unit-demand bidders
cites work: Multi-item Vickrey-Dutch auctions
cites work: Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
cites work: Combinatorial auctions with decreasing marginal utilities
cites work: \(M\)-convex function on generalized polymatroid
cites work: Convexity and Steinitz's exchange property
cites work: Discrete Convex Analysis
cites work: GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
cites work: A Double-Track Adjustment Process for Discrete Markets With Substitutes and Complements
cites work: Submodular functions and optimization.
cites work: On Steepest Descent Algorithms for Discrete Convex Functions
cites work: Exact bounds for steepest descent algorithms of $L$-convex function minimization
DOI: 10.1016/J.DISOPT.2016.01.001
Recommended article: Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland
Recommended article: Design of discrete Dutch auctions with consideration of time
Recommended article: Q4780786
Recommended article: From convex optimization to randomized mechanisms
Recommended article: Efficient constrained combinatorial auctions
Recommended article: Q3538310
Recommended article: Approximation algorithms for a winner determination problem of single-item multi-unit auctions
Recommended article: Computing and Combinatorics
Recommended article: Asymptotically optimal prior-free clock auctions
Recommended article: An Efficient Winner Approximation for a Series of Combinatorial Auctions
description: scientific article; zbMATH DE number 6872075