Shortest path to mechanism design

Rudolf Müller; Marc Uetz

doi:10.1007/978-3-319-24971-1_8

Shortest path to mechanism design

Rudolf Müller
, Marc Uetz^*

^*Corresponding author for this work

QE Operations research

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

Abstract

Mechanism design is concerned with computing 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 problems.

Original language	English
Title of host publication	Gems of Combinatorial Optimization and Graph Algorithms
Publisher	Springer International Publishing
Pages	83-94
Number of pages	12
ISBN (Electronic)	9783319249711
ISBN (Print)	9783319249704
DOIs	https://doi.org/10.1007/978-3-319-24971-1_8
Publication status	Published - 31 Jan 2016

Keywords

allocation rule
type space
type graph
true type
Vickrey auction

Access to Document

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

Cite this

@inbook{48eff41353854495bf71b6543393a8c7,

title = "Shortest path to mechanism design",

abstract = "Mechanism design is concerned with computing 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 problems.",

keywords = "allocation rule, type space, type graph, true type, Vickrey auction",

author = "Rudolf M{\"u}ller and Marc Uetz",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2017.",

year = "2016",

month = jan,

day = "31",

doi = "10.1007/978-3-319-24971-1\_8",

language = "English",

isbn = "9783319249704",

pages = "83--94",

booktitle = "Gems of Combinatorial Optimization and Graph Algorithms",

publisher = "Springer International Publishing",

address = "Switzerland",

}

TY - CHAP

T1 - Shortest path to mechanism design

AU - Müller, Rudolf

AU - Uetz, Marc

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2017.

PY - 2016/1/31

Y1 - 2016/1/31

N2 - Mechanism design is concerned with computing 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 problems.

AB - Mechanism design is concerned with computing 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 problems.

KW - allocation rule

KW - type space

KW - type graph

KW - true type

KW - Vickrey auction

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

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

M3 - Chapter

SN - 9783319249704

SP - 83

EP - 94

BT - Gems of Combinatorial Optimization and Graph Algorithms

PB - Springer International Publishing

ER -

Shortest path to mechanism design

Abstract

Keywords

Access to Document

Fingerprint

Cite this