SIGN IN
SIGN UP
Dynamic pricing for impatient bidders
Full Text:
PDF
Buy this Article
Authors:
Nikhil Bansal
IBM TJ Watson Research Center, Yorktown Heights, NY
Ning Chen
University of Washington, Seattle, WA
Neva Cherniavsky
University of Washington, Seattle, WA
Atri Rurda
University at Buffalo, The State University of New York, Buffalo, NY
Baruch Schieber
IBM TJ Watson Research Center, Yorktown Heights, NY
Maxim Sviridenko
IBM TJ Watson Research Center, Yorktown Heights, NY
2010 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 45
· Downloads (cumulative): 230
· Citation Count: 5
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 6 Issue 2, March 2010
Article No. 35
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1721837.1721851
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
digital goods
modes of computation
nonnumerical algorithms and problems
online algorithms
pricing
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder