The balloon popping problem revisited: lower and upper bounds

DOI10.1007/s00224-011-9314-yzbMath1262.91083OpenAlexW4233464813MaRDI QIDQ647488

Hyunwoo Jung, Kyung-Yong Chwa

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

zbMATH Keywords

upper boundlower boundauctionballot theorem

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (1)

New bounds for the balloon popping problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: The balloon popping problem revisited: lower and upper bounds