In this Book

summary

A comprehensive overview of networks and economic design, presenting models and results drawn from economics, operations research, and computer science; with examples and exercises.

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.

Table of Contents

  1. Cover
  2. open access View | Download |
  1. Title Page, Copyright, Dedication
  2. open access View | Download |
  1. Contents
  2. pp. vii-x
  3. open access Download |
  1. Foreword
  2. pp. xi-xii
  3. open access View | Download |
  1. Preface
  2. pp. xiii-xiv
  3. open access View | Download |
  1. Introduction
  2. pp. xv-xxvi
  3. open access View | Download |
  1. 1. Some Basics
  2. pp. 1-34
  3. open access View | Download |
  1. 2. Trees
  2. pp. 35-100
  3. open access View | Download |
  1. 3. Cycles
  2. pp. 101-128
  3. open access View | Download |
  1. 4. General Networks
  2. pp. 129-198
  3. open access View | Download |
  1. 5. Allocation in Decentralized Networks
  2. pp. 199-234
  3. open access View | Download |
  1. 6. Efficient Implementation
  2. pp. 235-266
  3. open access View | Download |
  1. Index
  2. pp. 267-268
  3. open access View | Download |

Additional Information

ISBN
9780262348676
Related ISBN
9780262038645
MARC Record
OCLC
1057237169
Pages
296
Launched on MUSE
2018-10-25
Language
English
Open Access
Yes
Back To Top

This website uses cookies to ensure you get the best experience on our website. Without cookies your experience may not be seamless.