Single and multi-dimensional optimal auctions : a network approach

Alexey Malakhov and Rakesh V. Vohra

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. -- Auctions ; Networks ; Linear Programming

MoreLess

Year of publication:	2004
Other Persons:	Malachov, Aleksej (contributor) ; Vohra, Rakesh V. (contributor)
Publisher:	Evanston : Northwestern Univ., Kellogg Graduate School of Management, Center for Mathematical Studies in Economics and Management Science
Subject:	Auktionstheorie \| Auction theory \| Netzwerk \| Network \| Mathematische Optimierung \| Mathematical programming

Extent:	Online Ressource, (43 S.)
Series:	Discussion paper / Center for Mathematical Studies in Economics and Management Science, Northwestern University. - Evanston, Ill. : [Verlag nicht ermittelbar], ZDB-ID 2186959-5. - Vol. 1397
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Arbeitspapier ; Working Paper ; Graue Literatur ; Non-commercial literature
Language:	English
Notes:	Systemvoraussetzungen: Acrobat reader
Other identifiers:	hdl:10419/31166 [Handle]
Classification:	C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C70 - Game Theory and Bargaining Theory. General ; D44 - Auctions
Source:	ECONIS - Online Catalogue of the ZBW

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