Price-Based Combinatorial Auction Design: Representative Valuations
We investigate price-based mechanisms with connectedness in combinatorial auctions, where with restrictions of privacy and complexity, the auctioneer asks a limited number of prices to buyers who provide demand responses. Consistent with the price-based property, several necessary and sufficient conditions are presented for the existence of the VCG mechanism, strategy-proofness with participation constraints, approximate strategy-proofness, Nash equilibrium, efficiency, core, and others. In all cases, the concept of the representative valuation function, which assigns the minimal valuation in both absolute and relative terms to any revealed package, plays the central role in determining whether these conditions are satisfied.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Nov 2010|
|Date of revision:|
|Contact details of provider:|| Postal: Hongo 7-3-1, Bunkyo-ku, Tokyo 113-0033|
Web page: http://www.cirje.e.u-tokyo.ac.jp/index.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:tky:fseres:2010cf776. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CIRJE administrative office)
If references are entirely missing, you can add them using this form.