On the robustness of non-linear personalized price combinatorial auctions

DOI10.1016/j.ejor.2010.01.038zbMath1188.91084OpenAlexW2035884894MaRDI QIDQ976430

B. E. Eshmatov

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.038

zbMATH Keywords

simulationallocative efficiencycomputational experimentcombinatorial auctionprimal-dual auctionsubgradient auction

Mathematics Subject Classification ID

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

Related Items (4)

Optimal bidding in auctions from a game theory perspective ⋮ A decision support framework for evaluating revenue performance in sequential purchase contexts ⋮ Recent advances in robust optimization: an overview ⋮ A trading mechanism contingent on several indices

Cites Work

• Unnamed Item
• On ascending Vickrey auctions for heterogeneous objects
• Ascending price Vickrey auctions for general valuations
• Reexamination of the perfectness concept for equilibrium points in extensive games
• The package assignment model.
• Auctions with bidder-determined allowable combinations
• Multi-object auctions with package bidding: an experimental comparison of Vickrey and iBEA
• Core-selecting package auctions
• Computationally Manageable Combinational Auctions
• Iterative Combinatorial Auctions with Bidder-Determined Combinations
• A New and Improved Design for Multiobject Iterative Auctions
• Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical
• On the Computational Power of Demand Queries
• Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
• Combinatorial auction design

This page was built for publication: On the robustness of non-linear personalized price combinatorial auctions