Strong activity rules for iterative combinatorial auctions
DOI10.1016/J.COR.2009.09.003zbMATH Open1178.90289OpenAlexW2139217167MaRDI QIDQ2655643FDOQ2655643
Authors: Pavithra Harsha, Cynthia Barnhart, David C. Parkes, Haoqi Zhang
Publication date: 25 January 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:3967325
Recommendations
Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Utility theory (91B16)
Cites Work
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- The Construction of Utility Functions from Expenditure Data
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Optimal auction with financially constrained buyers
- Budget-constrained sequential auctions with incomplete information
- Standard Auctions with Financially Constrained Bidders
- Manipulation of Voting Schemes: A General Result
- Multi-unit auctions with budget limits
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Algorithm for optimal winner determination in combinatorial auctions
- A new and improved design for multiobject iterative auctions
- Multiple-object auctions with budget constrained bidders
- The optimal mechanism for selling to a budget-constrained buyer
- Combinatorial auction design
- On ascending Vickrey auctions for heterogeneous objects
- Ascending price Vickrey auctions for general valuations
Cited In (4)
Uses Software
This page was built for publication: Strong activity rules for iterative combinatorial auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655643)