Shortest Path to Mechanism Design

Rudolf Müller, Marc Jochen Uetz

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Abstract

Mechanism design is concerned with the problem to compute desired outcomes in situations where data is distributed among selfish agents. We discuss some of the most fundamental questions in the design of mechanisms, and derive simple answers by interpreting the problem in graph theoretic terms. Specifically, much of mechanism design is thereby reformulated as shortest path problem.
Original languageEnglish
Title of host publicationGems of Combinatorial Optimization and Graph Algorithms
EditorsAndreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner
Place of PublicationBerlin
PublisherSpringer
Pages83-94
Number of pages13
ISBN (Electronic)978-3-319-24971-1
ISBN (Print)978-3-319-24970-4
DOIs
Publication statusPublished - 23 Dec 2015

Keywords

  • EWI-26781
  • MSC-90C27
  • MSC-90C35
  • MSC-90C90
  • IR-99346
  • Revenue Equivalence
  • Shortest Paths
  • METIS-315584
  • Mechanism Design

Cite this

Müller, R., & Uetz, M. J. (2015). Shortest Path to Mechanism Design. In A. S. Schulz, M. Skutella, S. Stiller, & D. Wagner (Eds.), Gems of Combinatorial Optimization and Graph Algorithms (pp. 83-94). Berlin: Springer. https://doi.org/10.1007/978-3-319-24971-1_8
Müller, Rudolf ; Uetz, Marc Jochen. / Shortest Path to Mechanism Design. Gems of Combinatorial Optimization and Graph Algorithms. editor / Andreas S. Schulz ; Martin Skutella ; Sebastian Stiller ; Dorothea Wagner. Berlin : Springer, 2015. pp. 83-94
@inbook{a9d7e19232ff4e27aeffdebad17b7c0d,
title = "Shortest Path to Mechanism Design",
abstract = "Mechanism design is concerned with the problem to compute desired outcomes in situations where data is distributed among selfish agents. We discuss some of the most fundamental questions in the design of mechanisms, and derive simple answers by interpreting the problem in graph theoretic terms. Specifically, much of mechanism design is thereby reformulated as shortest path problem.",
keywords = "EWI-26781, MSC-90C27, MSC-90C35, MSC-90C90, IR-99346, Revenue Equivalence, Shortest Paths, METIS-315584, Mechanism Design",
author = "Rudolf M{\"u}ller and Uetz, {Marc Jochen}",
year = "2015",
month = "12",
day = "23",
doi = "10.1007/978-3-319-24971-1_8",
language = "English",
isbn = "978-3-319-24970-4",
pages = "83--94",
editor = "Schulz, {Andreas S.} and Martin Skutella and Sebastian Stiller and Dorothea Wagner",
booktitle = "Gems of Combinatorial Optimization and Graph Algorithms",
publisher = "Springer",

}

Müller, R & Uetz, MJ 2015, Shortest Path to Mechanism Design. in AS Schulz, M Skutella, S Stiller & D Wagner (eds), Gems of Combinatorial Optimization and Graph Algorithms. Springer, Berlin, pp. 83-94. https://doi.org/10.1007/978-3-319-24971-1_8

Shortest Path to Mechanism Design. / Müller, Rudolf; Uetz, Marc Jochen.

Gems of Combinatorial Optimization and Graph Algorithms. ed. / Andreas S. Schulz; Martin Skutella; Sebastian Stiller; Dorothea Wagner. Berlin : Springer, 2015. p. 83-94.

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

TY - CHAP

T1 - Shortest Path to Mechanism Design

AU - Müller, Rudolf

AU - Uetz, Marc Jochen

PY - 2015/12/23

Y1 - 2015/12/23

N2 - Mechanism design is concerned with the problem to compute desired outcomes in situations where data is distributed among selfish agents. We discuss some of the most fundamental questions in the design of mechanisms, and derive simple answers by interpreting the problem in graph theoretic terms. Specifically, much of mechanism design is thereby reformulated as shortest path problem.

AB - Mechanism design is concerned with the problem to compute desired outcomes in situations where data is distributed among selfish agents. We discuss some of the most fundamental questions in the design of mechanisms, and derive simple answers by interpreting the problem in graph theoretic terms. Specifically, much of mechanism design is thereby reformulated as shortest path problem.

KW - EWI-26781

KW - MSC-90C27

KW - MSC-90C35

KW - MSC-90C90

KW - IR-99346

KW - Revenue Equivalence

KW - Shortest Paths

KW - METIS-315584

KW - Mechanism Design

U2 - 10.1007/978-3-319-24971-1_8

DO - 10.1007/978-3-319-24971-1_8

M3 - Chapter

SN - 978-3-319-24970-4

SP - 83

EP - 94

BT - Gems of Combinatorial Optimization and Graph Algorithms

A2 - Schulz, Andreas S.

A2 - Skutella, Martin

A2 - Stiller, Sebastian

A2 - Wagner, Dorothea

PB - Springer

CY - Berlin

ER -

Müller R, Uetz MJ. Shortest Path to Mechanism Design. In Schulz AS, Skutella M, Stiller S, Wagner D, editors, Gems of Combinatorial Optimization and Graph Algorithms. Berlin: Springer. 2015. p. 83-94 https://doi.org/10.1007/978-3-319-24971-1_8