CSE 522 – Algorithmic and Economic Aspects of the Internet. Instructors: Nicole Immorlica Mohammad Mahdian. News Break: Nobel Prize in Economics. Robert Aumann. Thomas Schelling. …for having enhanced our understanding of conflict and cooperation through game-theory analysis. This lecture.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
CSE 522 – Algorithmic and Economic Aspects of the Internet
…for having enhanced our understanding of conflict and cooperation through game-theory analysis.
How to find short paths in
a few random edges
Guaranteed path length
Definition: Expected delivery time is the expectation, over the choice of long-range contacts and a uniformly random source and destination, of the number of steps taken to deliver message.
algorithm is in phase j if 2j· dist(m,t) · 2(j+1)
expected time in phase j is at most log n for all j