Computer Science – Computer Science and Game Theory
Scientific paper
2012-04-25
Computer Science
Computer Science and Game Theory
7 pages
Scientific paper
We consider a monopoly seller who wishes to sell a single object to a single potential buyer. Given a distribution over the buyer's valuation of the object, Myerson auctions maximize the seller's expected revenue. A natural question is the relation between this revenue and other properties of the valuation distribution, and in particular which distribution characterizations can be used to bound the seller's revenue. An immediate upper bound on the seller's expected revenue is the expectation of the buyer's valuation. We show that a tight lower bound on the seller's expected revenue is 1/e times the geometric expectation of the valuation. This bound is uniquely achieved for the equal revenue distribution. We show also that when the valuation's expectation and geometric expectation are close, then the seller's expected revenue is close to the expected valuation.
No associations
LandOfFree
A lower bound on seller revenue in single buyer monopoly auctions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A lower bound on seller revenue in single buyer monopoly auctions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A lower bound on seller revenue in single buyer monopoly auctions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-137373