Pages that link to "Item:Q1366893"
From MaRDI portal
The following pages link to On a dynamic auction mechanism for a bilateral assignment problem (Q1366893):
Displaying 13 items.
- Properties of the DGS-auction algorithm (Q431903) (← links)
- Characterization of the Walrasian equilibria of the assignment model (Q845010) (← links)
- Multi-item Vickrey-Dutch auctions (Q1021601) (← links)
- An experimental examination into the design of decentralized methods to solve the assignment problem with and without money (Q1341475) (← links)
- Some fixed-point results for the dynamic assignment problem (Q1417768) (← links)
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- A forward/reverse auction algorithm for asymmetric assignment problems (Q1803649) (← links)
- A speedy auction using approximated bidders' preferences (Q2173118) (← links)
- A method for finding the maximal set in excess demand (Q2343311) (← links)
- Multi-item Vickrey-English-Dutch auctions (Q2436300) (← links)
- Sets in excess demand in simple ascending auctions with unit-demand bidders (Q2449341) (← links)
- Auction/Belief Propagation Algorithms for Constrained Assignment Problem (Q5174969) (← links)
- The bidding selection and assignment problem with minimum quantity commitment (Q5387408) (← links)