Towards fast Vickrey pricing using constraint programming

DOI10.1023/B:AIRE.0000036262.43475.22MaRDI QIDQ703125zbMATH OpenOpenAlexFDO

Authors Alan Holland, Barry O'Sullivan

Publication date 19 January 2005

Published in Artificial Intelligence Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:aire.0000036262.43475.22

zbMATH Keywords

Combinatorial auctionsConstraint programmingVickrey pricing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Microeconomic theory (price theory and economic markets) (91B24)

Recommendations

• Computationally feasible VCG mechanisms
• scientific article; zbMATH DE number 1748496
• Algorithm for optimal winner determination in combinatorial auctions
• A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions
• Truth revelation in approximately efficient combinatorial auctions

Cited in

(2)

• Metaheuristic approaches for the winner determination problem in combinatorial auction
• Recent Advances in Constraints

Describes a project that uses

Uses Software

• GraphBase

This page was built for publication: Towards fast Vickrey pricing using constraint programming

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