Strategyproof auction mechanisms for network procurement

DOI10.1007/s00291-020-00597-7zbMath1456.90096OpenAlexW3044331085MaRDI QIDQ2215560

Stefan Waldherr, Martin Bichler, Richard Littmann, Zhen Hao

Publication date: 13 December 2020

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-020-00597-7

zbMATH Keywords

Steiner tree problemapproximation mechanismdeferred-acceptance auctionnetwork procurement

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Uses Software

• SteinLib
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tabu search heuristic for the generalized minimum spanning tree problem
• A fast algorithm for Steiner trees
• A note on finding the bridges of a graph
• General network design: a unified view of combined location and network design problems
• Truthful approximation mechanisms for restricted combinatorial auctions
• Algorithmic mechanism design (extended abstract)
• An improved LP-based approximation for steiner tree
• Truth revelation in approximately efficient combinatorial auctions
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Optimal Auction Design
• Incentives in Teams
• Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
• The Performance of Deferred-Acceptance Auctions
• Reducibility among Combinatorial Problems
• Tighter Bounds for Graph Steiner Tree Approximation
• Truthful and Near-Optimal Mechanism Design via Linear Programming
• An algorithm composition scheme preserving monotonicity
• Algorithmic Game Theory
• Computing and Combinatorics
• A faster approximation algorithm for the Steiner problem in graphs