The balloon popping problem revisited: lower and upper bounds

DOI10.1007/S00224-011-9314-YzbMATH Open1262.91083OpenAlexW4233464813MaRDI QIDQ647488FDOQ647488

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

Recommendations

• The balloon popping problem revisited: lower and upper bounds
• New bounds for the balloon popping problem
• New bounds for the balloon popping problem
• Near-optimal online auctions
• Optimal competitive auctions

zbMATH Keywords

lower boundupper boundauctionballot theorem

Mathematics Subject Classification ID

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

Cites Work

• A problem of arrangements
• On profit-maximizing envy-free pricing
• AdWords and generalized online matching
• 75.9 Euler’s Constant
• Optimal Auction Design
• Title not available (Why is that?)
• On maximizing welfare when utility functions are subadditive
• Truthful randomized mechanisms for combinatorial auctions
• Near-optimal online auctions
• Algorithm Theory - SWAT 2004
• Two Randomized Mechanisms for Combinatorial Auctions
• Revenue maximization when bidders have budgets
• Title not available (Why is that?)

Cited In (2)

• New bounds for the balloon popping problem
• The balloon popping problem revisited: lower and upper bounds

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647488)