File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Competitive algorithms for online pricing

TitleCompetitive algorithms for online pricing
Authors
Issue Date2011
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 17th Annual International Computing and Combinatorics Conference (COCOON'11), Dallas, TX., 14-16 August 2011. In Lecture Notes in Computer Science, 2011, v. 6842, p. 391-401 How to Cite?
AbstractGiven a seller with m amount of items, a sequence of users {u1, u2, ...} come one by one, the seller must set the unit price and assign some amount of items to each user on his/her arrival. Items can be sold fractionally. Each ui has his/her value function vi (·) such that vi (x) is the highest unit price ui is willing to pay for x items. The objective is to maximize the revenue by setting the price and amount of items for each user. In this paper, we have the following contributions: if the highest value h among all vi (x) is known in advance, we first show the lower bound of the competitive ratio is O(logh), then give an online algorithm with competitive ratio O(logh); if h is not known in advance, we give an online algorithm with competitive ratio O(h3log-1/2h). © 2011 Springer-Verlag.
DescriptionLNCS v. 6842 has title: Computing and combinatorics : 17th Annual International Conference, COCOON 2011 .... Proceedings
Persistent Identifierhttp://hdl.handle.net/10722/139997
ISBN
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorZhang, Yen_HK
dc.contributor.authorChin, FYLen_HK
dc.contributor.authorTing, HFen_HK
dc.date.accessioned2011-09-23T06:04:31Z-
dc.date.available2011-09-23T06:04:31Z-
dc.date.issued2011en_HK
dc.identifier.citationThe 17th Annual International Computing and Combinatorics Conference (COCOON'11), Dallas, TX., 14-16 August 2011. In Lecture Notes in Computer Science, 2011, v. 6842, p. 391-401en_HK
dc.identifier.isbn978-3-642-22684-7-
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/139997-
dc.descriptionLNCS v. 6842 has title: Computing and combinatorics : 17th Annual International Conference, COCOON 2011 .... Proceedings-
dc.description.abstractGiven a seller with m amount of items, a sequence of users {u1, u2, ...} come one by one, the seller must set the unit price and assign some amount of items to each user on his/her arrival. Items can be sold fractionally. Each ui has his/her value function vi (·) such that vi (x) is the highest unit price ui is willing to pay for x items. The objective is to maximize the revenue by setting the price and amount of items for each user. In this paper, we have the following contributions: if the highest value h among all vi (x) is known in advance, we first show the lower bound of the competitive ratio is O(logh), then give an online algorithm with competitive ratio O(logh); if h is not known in advance, we give an online algorithm with competitive ratio O(h3log-1/2h). © 2011 Springer-Verlag.en_HK
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Scienceen_HK
dc.rightsThe original publication is available at www.springerlink.comen_US
dc.titleCompetitive algorithms for online pricingen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChin, FYL: chin@cs.hku.hken_HK
dc.identifier.emailTing, HF: hfting@cs.hku.hken_HK
dc.identifier.authorityChin, FYL=rp00105en_HK
dc.identifier.authorityTing, HF=rp00177en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-22685-4_35en_HK
dc.identifier.scopuseid_2-s2.0-80052019406en_HK
dc.identifier.hkuros194297en_US
dc.identifier.hkuros209696-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80052019406&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume6842en_HK
dc.identifier.spage391en_HK
dc.identifier.epage401en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridZhang, Y=35114314500en_HK
dc.identifier.scopusauthoridChin, FYL=7005101915en_HK
dc.identifier.scopusauthoridTing, HF=7005654198en_HK
dc.customcontrol.immutablesml 130402-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats