11-24
Incentive Compatibility and Dynamics of Internet Protocols

The internet, a large and distributed system, is not controlled by a single economic entity but rather by multiple agents, each with its own agenda. From this point of view, internet protocols are merely recommendations that agents can choose to ignore if they have anything to gain by doing so. Protocols must therefore be designed to include the right incentives, or agents may decide not to follow them. The talk will mainly focus on a model of congestion control in networks, where the interested agents are the end-hosts who try to maximize their throughput. In this setting, the packet dropping policies of the routers greatly affect the incentives of agents and the convergence properties of the network. I will discuss conditions under which congestion control schemes can be both efficient, so that capacity is not wasted, and incentive compatible, so that each participant can maximize its utility by following the prescribed protocol. As in other protocols, questions of incentive compatibility are often intrinsically linked to the convergence of the network dynamics when agents follow the protocol, and the understanding of one issue goes hand in hand with the understanding of the other.

Based on work with Brighten Godfrey, Hagay Levin, Jeff Rosenschein, Rahul Sami, Michael Schapira, and Scott Shenker.

Date and Time
Tuesday November 24, 2009 3:00pm - 4:00pm
Location
Computer Science 402
Event Type
Speaker
Aviv Zohar, from Hebrew University
Host
Jennifer Rexford

Contributions to and/or sponsorship of any event does not constitute departmental or institutional endorsement of the specific program, speakers or views presented.

CS Talks Mailing List