Funder
JST, ERATO, Kawarabayashi Large Graph Project
Japan Society for the Promotion of Science
Research Grants Council, University Grants Committee, Hong Kong
NSFC
Japan Science and Technology Agency
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference16 articles.
1. Ashwinkumar, B.V.: Buyback problem - approximate matroid intersection with cancellation costs. In: Proceedings of the 38th International Colloquium on Automata, Language and Programming, pp. 379–390 (2011)
2. Ashwinkumar, B.V., Kleinberg, R.: Randomized online algorithms for the buyback problem. In: Internet and network economics, pp. 529–536 (2009)
3. Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling banner ads: online algorithms with buyback. In: Proceedings of the 4th Workshop on Ad Auctions (2008)
4. Babaioff, M., Hartline, J.D., Kleinberg, R. D.: Selling ad campaigns: online algorithms with cancel- lations. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 61–70 (2009)
5. Biyalogorsky, E., Carmon, Z., Fruchter, G.E., Gerstner, E.: Research note: overselling with opportunistic cancellations. Mark. Sci. 18(4), 605–610 (1999)