1. Homepage
  2. Homework
  3. STAT155 Game Theory - Homework 5: Selfish Routing, the Price of Anarchy, Over-Provisioning and Atomic Selfish Routing
This question has been solved

STAT155 Game Theory - Homework 5: Selfish Routing, the Price of Anarchy, Over-Provisioning and Atomic Selfish Routing

Engage in a Conversation
USUC BerkeleySTAT155Game TheorySimple Near-Optimal AuctionsMulti-Parameter MechanismSpectrum AuctionsVCG mechanismSelfish RoutingOver-ProvisioningPrice of Anarchy

Homework 5 Questions

Exercise 11.2 (H) Prove that if C is the set of nonnegative, nondecreasing, and concave cost functions, then α(C)=43 . CourseNana.COM

  CourseNana.COM

Exercise 11.3 For a positive integer p, let Cp denote the set of polynomials with nonnegative coefficients and degree at most p: Cp={i=0paixi:a0,...,ap0}. CourseNana.COM

(a) Prove that the Pigou bound of the singleton set {xp} is increasing in p. CourseNana.COM

(b) Prove that the Pigou bound of the set {axi:a0,i{0,1,2...,p}} is the same as that of the set{xp}. CourseNana.COM

(c) (H) Prove that Pigou bound of Cp is the same as that of the set{xp}. CourseNana.COM

  CourseNana.COM

Problem 11.2 In this problem we consider an alternative objective function, that of minimizing the maximum travel time CourseNana.COM

maxPP:fp>0?ePce(fe) CourseNana.COM

of a flow f. The price of anarchy (POA) with respect to this objective is then defined as the ratio between the maximum cost of an equilibrium flow and that of a flow with minimum-possible maximum cost. We assume throughout this problem that there is one origin, one destination, one unit of traffic, and affine cost functions (of the form ce(x)=aex+be for ae,be0). CourseNana.COM

(a) Prove that in networks with only two vertices o and d, and any number of parallel edges, the POA with respect to the maximum cost objective is 1. CourseNana.COM

(b) (H) Prove that the POA with respect to the maximum cost objective can be as large as 4/3. CourseNana.COM

(c) (H) Prove that the POA with respect to the maximum cost objective is never larger than 4/3. CourseNana.COM

  CourseNana.COM

Exercise 12.3 Prove that the following statement is equivalent to Theorem 12.1: If f is a minimum-cost flow in a selfish routing network with cost functions c and f is an equilibrium flow in the same network with cost functions c̃, where c̃(x) is defined as ce(x/2)/2, then CourseNana.COM

C~(f)C(f) CourseNana.COM

The notation C~ and C refers to the cost of a flow (11.3) with the cost functions c~ and c, respectively. CourseNana.COM

Get in Touch with Our Experts

WeChat WeChat
Whatsapp WhatsApp
US代写,UC Berkeley代写,STAT155代写,Game Theory代写,Simple Near-Optimal Auctions代写,Multi-Parameter Mechanism代写,Spectrum Auctions代写,VCG mechanism代写,Selfish Routing代写,Over-Provisioning代写,Price of Anarchy代写,US代编,UC Berkeley代编,STAT155代编,Game Theory代编,Simple Near-Optimal Auctions代编,Multi-Parameter Mechanism代编,Spectrum Auctions代编,VCG mechanism代编,Selfish Routing代编,Over-Provisioning代编,Price of Anarchy代编,US代考,UC Berkeley代考,STAT155代考,Game Theory代考,Simple Near-Optimal Auctions代考,Multi-Parameter Mechanism代考,Spectrum Auctions代考,VCG mechanism代考,Selfish Routing代考,Over-Provisioning代考,Price of Anarchy代考,UShelp,UC Berkeleyhelp,STAT155help,Game Theoryhelp,Simple Near-Optimal Auctionshelp,Multi-Parameter Mechanismhelp,Spectrum Auctionshelp,VCG mechanismhelp,Selfish Routinghelp,Over-Provisioninghelp,Price of Anarchyhelp,US作业代写,UC Berkeley作业代写,STAT155作业代写,Game Theory作业代写,Simple Near-Optimal Auctions作业代写,Multi-Parameter Mechanism作业代写,Spectrum Auctions作业代写,VCG mechanism作业代写,Selfish Routing作业代写,Over-Provisioning作业代写,Price of Anarchy作业代写,US编程代写,UC Berkeley编程代写,STAT155编程代写,Game Theory编程代写,Simple Near-Optimal Auctions编程代写,Multi-Parameter Mechanism编程代写,Spectrum Auctions编程代写,VCG mechanism编程代写,Selfish Routing编程代写,Over-Provisioning编程代写,Price of Anarchy编程代写,USprogramming help,UC Berkeleyprogramming help,STAT155programming help,Game Theoryprogramming help,Simple Near-Optimal Auctionsprogramming help,Multi-Parameter Mechanismprogramming help,Spectrum Auctionsprogramming help,VCG mechanismprogramming help,Selfish Routingprogramming help,Over-Provisioningprogramming help,Price of Anarchyprogramming help,USassignment help,UC Berkeleyassignment help,STAT155assignment help,Game Theoryassignment help,Simple Near-Optimal Auctionsassignment help,Multi-Parameter Mechanismassignment help,Spectrum Auctionsassignment help,VCG mechanismassignment help,Selfish Routingassignment help,Over-Provisioningassignment help,Price of Anarchyassignment help,USsolution,UC Berkeleysolution,STAT155solution,Game Theorysolution,Simple Near-Optimal Auctionssolution,Multi-Parameter Mechanismsolution,Spectrum Auctionssolution,VCG mechanismsolution,Selfish Routingsolution,Over-Provisioningsolution,Price of Anarchysolution,