Winner determination algorithms for electronic auctions: A framework design

DOI10.1007/3-540-45705-4_5MaRDI QIDQ4708152zbMATH OpenFDO

Authors Martin Bichler, Juhnyoung Lee, Jayant Kalagnanam, Hosoo Lee

Publication date 12 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2455/24550037.htm

Mathematics Subject Classification ID

Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Computing methodologies and applications (68U99) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• A framework of winner determination algorithms for internet auctions
• Design issues for combinatorial auctions
• Combinatorial auctions
• Combinatorial auction design
• BOB: Improved winner determination in combinatorial auctions and generalizations

Cited in

(5)

• A new hybrid algorithm to solve winner determination problem in multiunit double internet auction
• Configurable offers and winner determination in multi-attribute auctions
• A framework of winner determination algorithms for internet auctions
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
• Exact algorithms for procurement problems under a total quantity discount structure

This page was built for publication: Winner determination algorithms for electronic auctions: A framework design

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