This book explores networks and economic design, focusing on the role played by allocation rules (revenue and cost-sharing schemes) in creating and sustaining efficient network solutions. It takes a normative approach, seeking economically efficient network solutions sustained by distributional fairness, and considers how different ways of allocating liability affect incentives for network usage and development. The text presents an up-to-date overview of models and results currently scattered over several strands of literature, drawing on economics, operations research, and computer science.
The book's analysis of allocation problems includes such classic models from combinatorial optimization as the minimum cost spanning tree and the traveling salesman problem. It examines the planner's ability to design mechanisms that will implement efficient network structures, both in large decentralized networks and when there is user-agent information asymmetry. Offering systematic theoretical analyses of various compelling allocation rules in cases of fixed network structures as well as discussions of network design problems, the book covers such topics as tree-structured distribution systems, routing games, organizational hierarchies, the “price of anarchy,” mechanism design, and efficient implementation. Appropriate as a reference for practitioners in network regulation and the network industry or as a text for graduate students, the book offers numerous illustrative examples and end-of-chapter exercises that highlight the concepts and methods presented.
This book explores networks and economic design, focusing on the role played by allocation rules (revenue and cost-sharing schemes) in creating and sustaining efficient network solutions. It takes a normative approach, seeking economically efficient network solutions sustained by distributional fairness, and considers how different ways of allocating liability affect incentives for network usage and development. The text presents an up-to-date overview of models and results currently scattered over several strands of literature, drawing on economics, operations research, and computer science.
The book's analysis of allocation problems includes such classic models from combinatorial optimization as the minimum cost spanning tree and the traveling salesman problem. It examines the planner's ability to design mechanisms that will implement efficient network structures, both in large decentralized networks and when there is user-agent information asymmetry. Offering systematic theoretical analyses of various compelling allocation rules in cases of fixed network structures as well as discussions of network design problems, the book covers such topics as tree-structured distribution systems, routing games, organizational hierarchies, the “price of anarchy,” mechanism design, and efficient implementation. Appropriate as a reference for practitioners in network regulation and the network industry or as a text for graduate students, the book offers numerous illustrative examples and end-of-chapter exercises that highlight the concepts and methods presented.
Allocation in Networks
296
Allocation in Networks
296Related collections and offers
Product Details
| ISBN-13: | 9780262348683 |
|---|---|
| Publisher: | MIT Press |
| Publication date: | 11/06/2018 |
| Series: | The MIT Press |
| Sold by: | Penguin Random House Publisher Services |
| Format: | eBook |
| Pages: | 296 |
| File size: | 11 MB |
| Note: | This product may take a few minutes to download. |
| Age Range: | 18 Years |