2 research outputs found
Shortest Path to Mechanism Design
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
Shortest Path to Mechanism Design
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