Lecture 17: 10.22.03 Lecturer: Christos Papadimitriou Scribe: Brian Milch and ...  Home/Search
Context
Related
| Berkeley.edu/~christos...scribe.1022.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: Berkeley.edu/~christos/ga...cs294 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ximize his profit by minimizing d st , that is, bidding so that the chosen path is as short as possible. . The payment is the largest amount that e could bid and still be chosen as part of the shortest path. Once the agents submit their costs, we must run an algorithm to find the shortest path P min . Then to compute the payments, it seems that we must run the algorithm again for each e P min , which might mean all n edges. However: Theorem 17.1 ([HS01]) In an undirected graph, the x e... (Update)
Active bibliography (related documents): More All
0.2: True Costs of Cheap Labor Are Hard To Measure: Edge Deletion and.. - Elkind (2004) (Correct)
0.2: On the Expected Payment of Mechanisms for Task Allocation - Artur Czumaj Amir (Correct)
0.2: Towards Generic Low Payment Mechanisms for Task - Allocation Artur Czumaj (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: CS270 Combinatorial Algorithms Data Structures Spring 2003 - Lecture Lecturer Christos (Correct)
0.3: CS294 Game Theory and the Internet Fall 2003 - Lecture Lecturer Brian (Correct)
0.2: Lecture 9,10: March 13,20 - Lecturer Christos Papadimitriou (Correct)
BibTeX entry: (Update)
@misc{ christos-cs,
author = "Lecture Lecturer Christos",
title = "CS294 Game Theory and the Internet Fall 2003",
url = "citeseer.ist.psu.edu/702770.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 2000
283 Random Graphs (context) - Bollobas - 1985
43 A BGP-based mechanism for lowestcost routing - Feigenbaum, Papadimitriou et al. - 2002
34 Vickrey prices and shortest paths: What is an edge worth - Hershberger, Suri - 2001
34 Vickrey prices and shortest paths: What is an edge worth - Hershberger, Suri - 2002
11 On certain connectivity properties of the Internet topology - Mihail, Papadimitriou et al. - 2003
10 Frugality in path auctions - Elkind, Sahai et al. - 2004
Documents on the same site (http://http.cs.Berkeley.edu/~christos/games03/cs294.html): More
CS294 Game Theory and the Internet Fall 2003 - Lecture September Lecturer (Correct)
CS294 Game Theory and the Internet Fall 2003 - Lecture Lecturer Christos (Correct)
CS294 Game Theory and the Internet Fall 2003 - Lecture Lecturer Brian (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC