Algorithmic Issues in Network Design and in Information Access

Abstract

There has been a few main areas of efforts. (1) understanding the tradeoffs between central allocation and the cost of relying on selfish behavior in different games, including a simple model of routing on the Internet, (2) Designing algorithms and mechanisms for optimization problems for selfish users such as scheduling, path selection, and auctions, (3) design of network topology, and server placement. I will review results in each of these three areas separately.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 2002
Accession Number
ADA409842

Entities

People

  • Éva Tardos

Organizations

  • Cornell University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Commerce
  • Commodities
  • Congestion
  • Cooperative Games
  • Flow Network
  • Game Theory
  • Graphs
  • Internet
  • Network Topology
  • Networks
  • Non-Cooperative Games
  • Numbers
  • Optimization
  • Scheduling (Production)
  • Social Welfare
  • Topology

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Operations Research