Properties of the DGS-auction algorithm

DOI10.1007/S10614-010-9237-8MaRDI QIDQ431903zbMATH OpenOpenAlexFDO

Authors Tommy Andersson, Christer Andersson

Publication date 3 July 2012

Published in Computational Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10614-010-9237-8

zbMATH Keywords

algorithmic propertiescomputer simulationsgraphsmulti-item auctions

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• The auction algorithm for assignment and other network flow problems
• Auction Algorithms for Market Equilibrium
• Auction algorithms for market equilibrium
• Auction algorithms for network flow problems: A tutorial introduction
• Fast convergence in the double oral auction

Cites work

• An Efficient Multi-Unit Ascending Auction
• Controlling the learning process of real-time heuristic search
• Maximal Flow Through a Network
• Multi-item Vickrey-Dutch auctions
• Non-manipulable assignment of individuals to positions revisited
• On a dynamic auction mechanism for a bilateral assignment problem
• Real-time heuristic search
• Room assignment-rent division: a market approach
• Sets in excess demand in simple ascending auctions with unit-demand bidders
• The auction algorithm: A distributed relaxation method for the assignment problem
• The English auction with differentiated commodities
• The Strategy Structure of Two-Sided Matching Markets

Cited in

(3)

• Sealed bid auctions versus ascending bid auctions: an experimental study
• Multi-item Vickrey-English-Dutch auctions
• Sets in excess demand in simple ascending auctions with unit-demand bidders

Describes a project that uses

Uses Software

• Boost
• BGL

This page was built for publication: Properties of the DGS-auction algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q431903)