The Balloon Popping Problem Revisited: Lower and Upper Bounds
We consider the balloon popping problem introduced by Immorlica et al. (Proceedings of FOCS’07, pp. 104–112, 2007). This problem is directly related to the problem of profit maximization in online auctions, where an auctioneer is selling a collection of identical items to anonymous unit-demand bidde...
|Published in:||Theory of Computing Systems, Vol. 49, No. 1 (2011), p. 182-195|
|Other Involved Persons:|
|QR Code:||Show QR Code|