Incentives in Online Auctions via Linear Programming

This work develops new mechanisms for a variant of the secretary problem and shows that the new mechanisms can be used as a building block for a family of incentive compatible mechanisms for the online auction problem which perform well under different performance criteria.