On a dynamic auction mechanism for a bilateral assignment problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 515937
- The auction algorithm for assignment and other network flow problems
- Reverse Auction and the Solution of Inequality Constrained Assignment Problems
- An experimental examination into the design of decentralized methods to solve the assignment problem with and without money
Cites work
Cited in
(14)- Multi-item Vickrey-Dutch auctions
- An experimental examination into the design of decentralized methods to solve the assignment problem with and without money
- Some fixed-point results for the dynamic assignment problem
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- A forward/reverse auction algorithm for asymmetric assignment problems
- A speedy auction using approximated bidders' preferences
- A method for finding the maximal set in excess demand
- Multi-item Vickrey-English-Dutch auctions
- Sets in excess demand in simple ascending auctions with unit-demand bidders
- Properties of the DGS-auction algorithm
- Dynamic auction mechanism of online peer-to-peer lending market considering bilateral sealed bidding
- Auction/Belief Propagation Algorithms for Constrained Assignment Problem
- The bidding selection and assignment problem with minimum quantity commitment
- Characterization of the Walrasian equilibria of the assignment model
This page was built for publication: On a dynamic auction mechanism for a bilateral assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366893)
