Algorithmic Issues in Network Design and in Information Access

摘要

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.