Efficient generation of top-k procurements in a multi-item auction

DOI10.1007/978-3-319-30139-6_15zbMATH Open1475.91117DBLPconf/walcom/SanyalMH16OpenAlexW2461091534WikidataQ60691747 ScholiaQ60691747MaRDI QIDQ2803822FDOQ2803822

Authors: Biswajit Sanyal, Subhashis Majumder, Wing-Kai Hon 

Publication date: 3 May 2016

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_15

Recommendations

• Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions
• Efficiently Generating k-Best Solutions to Procurement Auctions
• Vickrey-Dutch procurement auction for multiple items
• Bid evaluation in procurement auctions with piecewise linear supply curves
• Optimal auctions for multi-unit procurement with volume discount bids

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms.
• Finding the k Shortest Paths
• $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking
• Efficiently Generating k-Best Solutions to Procurement Auctions

Cited In (3)

• Efficiently Generating k-Best Solutions to Procurement Auctions
• Bid evaluation in procurement auctions with piecewise linear supply curves
• Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions

This page was built for publication: Efficient generation of top-\(k\) procurements in a multi-item auction

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