Single and multi-dimensional optimal auctions: a network approach

This paper highlights connections between the discrete and continuous approaches to optimal auction design with single and multi-dimensional types. We provide an interpretaion of an optimal auction design problem in terms of a linear program that is an instance of a parametric shortest path problem on a lattice. We also solve some cases explicitly in the discrete framework.

MoreLess

Year of publication:	2004
Authors:	Malakhov, Alexey ; Vohra, Rakesh V.
Publisher:	Evanston, IL : Northwestern University, Kellogg School of Management, Center for Mathematical Studies in Economics and Management Science
Subject:	Auktionstheorie \| Netzwerk \| Mathematische Optimierung \| Auctions \| Networks \| Linear Programming

More details

Series:	Discussion Paper ; 1397
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	586181180 [GVK] hdl:10419/31166 [Handle] RePEc:nwu:cmsems:1397 [RePEc]
Classification:	C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C70 - Game Theory and Bargaining Theory. General ; D44 - Auctions
Source:	EconStor

Persistent link: https://www.econbiz.de/10010266256