On the robustness of non-linear personalized price combinatorial auctions
From MaRDI portal
Publication:976430
Recommendations
Cites work
- A new and improved design for multiobject iterative auctions
- Ascending price Vickrey auctions for general valuations
- Auctions with bidder-determined allowable combinations
- Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
- Combinatorial auction design
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Computationally manageable combinational auctions
- Core-selecting package auctions
- Iterative Combinatorial Auctions with Bidder-Determined Combinations
- Multi-object auctions with package bidding: an experimental comparison of Vickrey and iBEA
- On ascending Vickrey auctions for heterogeneous objects
- On the computational power of demand queries
- Reexamination of the perfectness concept for equilibrium points in extensive games
- The package assignment model.
- Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical
Cited in
(4)
This page was built for publication: On the robustness of non-linear personalized price combinatorial auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976430)