Properties of the DGS-auction algorithm
From MaRDI portal
Publication:431903
DOI10.1007/s10614-010-9237-8zbMath1243.91051OpenAlexW2017706080MaRDI QIDQ431903
Christer Andersson, Tommy 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
Related Items (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
Uses Software
Cites Work
- Controlling the learning process of real-time heuristic search
- Non-manipulable assignment of individuals to positions revisited
- Multi-item Vickrey-Dutch auctions
- The auction algorithm: A distributed relaxation method for the assignment problem
- On a dynamic auction mechanism for a bilateral assignment problem
- The English auction with differentiated commodities
- Room assignment-rent division: a market approach
- Sets in excess demand in simple ascending auctions with unit-demand bidders
- Real-time heuristic search
- Maximal Flow Through a Network
- The Strategy Structure of Two-Sided Matching Markets
- An Efficient Multi-Unit Ascending Auction
This page was built for publication: Properties of the DGS-auction algorithm
