Optimal Auctions with Budget Constraints

Subscribers:
351,000
Published on ● Video Link: https://www.youtube.com/watch?v=HvKNv5jNlaY



Duration: 1:14:47
251 views
4


We consider an environment where potential buyers of an indivisible good have liquidity constraints, in that they cannot pay more than their `budget' regardless of their valuation. A buyer's valuation for the good as well as her budget are her private information. We derive constrained-efficient and revenue maximizing auctions for this setting. In general, the optimal auction requires ΓÇÿpoolingΓÇÖ both at the top and in the middle despite the maintained assumption of a monotone hazard rate. Further, the auctioneer will never find it desirable to offer lump sum subsidies to bidders with low budgets. On a technical note, our analysis is based on the `reduced formΓÇÖ representation of auctions, which enables one to exploit a polymatroid representation of auctions. This polymatroid representation is useful in other applications, time permitting, will be outlined.




Other Videos By Microsoft Research


2016-08-17Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
2016-08-17Spectral graph sparsification Part 1: -- (The Combinatorial Multigrid Solver)
2016-08-17Glauber Dynamics for the 2D Ising Model at Low Temperature
2016-08-17Sheriff: Detecting and Eliminating False Sharing
2016-08-17National Renewable Energy Lab, renewable energy and the compute space
2016-08-17Insights into Ad-sponsored Mobile Software
2016-08-17End-User Creation of Mashups and Cross-Device UI Prototypes
2016-08-17Fully Homomorphic Encryption; Bi-Deniable Encryption; We Have The Technology, Now Where Next?
2016-08-17Verifying Safety and Liveness Properties of a Kernelized Web Browser
2016-08-17The successes and challenges of making low-data languages in online automatic translation portals
2016-08-17Optimal Auctions with Budget Constraints
2016-08-17Proof of Aldous' spectral gap conjecture
2016-08-17Why Social Computing Is So Hard
2016-08-17Metastabiity and logarithmic energy barriers for a polymer dynamics
2016-08-17Predicate Encryption; Structured Encryption and Controlled Disclosure; Cloud Cryptography
2016-08-17Approximation Schemes for Optimization
2016-08-17All pairs shortest path in quadratic time with high probability
2016-08-17Steering and Capturing Human Insight for Large-Scale Learning of Visual Objects
2016-08-17Welcome and opening remarks; Point Obfuscation and Friends; Outsourcing Computation
2016-08-17Laser Processing of Materials III
2016-08-17Finding all min st-cuts in planar graphs



Tags:
microsoft research