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-07
Authors:	Malakhov, Alexey ; Vohra, Rakesh V.
Institutions:	Center for Mathematical Studies in Economics and Management Science (CMS-EMS), Kellogg Graduate School of Management
Subject:	Auctions \| Networks \| Linear Programming

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Discussion Papers.
Type of publication:	Book / Working Paper
Language:	English
Notes:	Number 1397
Classification:	C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C70 - Game Theory and Bargaining Theory. General ; D44 - Auctions
Source:	RePEc - Research Papers in Economics

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