• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Norges Handelshøyskole
  • Centre for Applied Research at NHH (SNF)
  • Working papers (SNF)
  • View Item
  •   Home
  • Norges Handelshøyskole
  • Centre for Applied Research at NHH (SNF)
  • Working papers (SNF)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An analysis of a combinatorial auction

Bjørndal, Mette; Jörnsten, Kurt
Working paper
Thumbnail
View/Open
A19_01.pdf (53.40Kb)
URI
http://hdl.handle.net/11250/165980
Date
2001-05
Metadata
Show full item record
Collections
  • Working papers (SNF) [809]
Abstract
Our objective is to find prices on individual items in a combinatorial auction that support the optimal allocation of bundles of items, i.e. the solution to the winner determination problem of the combinatorial auction. The item-prices should price the winning bundles according to the corresponding winning bids, whereas the bundles that do not belong to the winning set should have strictly positive reduced cost. I.e. the bid on a non-winning bundle is strictly less than the sum of prices of the individual items that belong to the bundle, thus providing information to the bidders why they are not in the winning set. Since the winner determination problem is an integer program, in general we cannot find a linear price-structure with these characteristics. However, in this article we make use of sensitivity analysis and duality in linear programming to obtain this kind of price-information. The ideas are illustrated by means of numerical examples.
Publisher
SNF
Series
Working Paper
2001:19

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit