Please use this identifier to cite or link to this item: https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1735
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSen, Anup Kumar
dc.contributor.authorBagchi, Amitava
dc.date.accessioned2021-08-26T06:23:48Z-
dc.date.available2021-08-26T06:23:48Z-
dc.date.issued2014
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84924692069&partnerID=40&md5=9b4955e7659b7a5074931147ad312846
dc.identifier.urihttps://ir.iimcal.ac.in:8443/jspui/handle/123456789/1735-
dc.descriptionSen, Anup Kumar, Indian Institute of Management Calcutta, Kolkata, India; Bagchi, Amitava, Heritage Institute of Technology, Kolkata, India
dc.description.abstractIn online combinatorial auctions (CAs), the deadness level (DL) of a package serves as an ask price on a fresh bid that can be meaningfully placed on the package. The DL values of packages in single-unit CAs can be readily determined. But multi-unit CAs have significantly different properties, making the package DLs much harder to obtain, and no closed form expression or computational method has been proposed as yet. Here we present for the first time an exact method for determining package DLs in the multi-unit case, assuming an OR bidding language is being used. It allows fast incremental computations of ask prices after each bid, and will help to promote bidder participation in online multi-unit eBay-like CAs in the procurement and sale of commodities.
dc.publisherSCOPUS
dc.publisher24th Workshop on Information Technology and Systems
dc.publisherUniversity of Auckland Business School
dc.subjectAsk price
dc.subjectE-business and e-commerce
dc.subjectIntelligent agent-based systems
dc.subjectIterative auctions
dc.subjectMulti-unit combinatorial auctions
dc.titleHow much to bid on a package in an online multi-unit combinatorial auction
dc.typeConference Paper
Appears in Collections:Management Information Systems

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.