The balloon popping problem revisited: lower and upper bounds
From MaRDI portal
Publication:647488
DOI10.1007/s00224-011-9314-yzbMath1262.91083MaRDI QIDQ647488
Publication date: 23 November 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9314-y
91B26: Auctions, bargaining, bidding and selling, and other market models
Related Items
Cites Work
- A problem of arrangements
- On maximizing welfare when utility functions are subadditive
- AdWords and generalized online matching
- Revenue maximization when bidders have budgets
- Two Randomized Mechanisms for Combinatorial Auctions
- Optimal Auction Design
- Algorithm Theory - SWAT 2004
- 75.9 Euler’s Constant
- Truthful randomized mechanisms for combinatorial auctions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item