LecXX2

LecXX2 - 1 COT 6936 1 COT 6936 Topics in Algorithms Giri...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 3/25/10 COT 6936 1 COT 6936: Topics in Algorithms Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 [email protected] http://www.cs.fiu.edu/~giri/teach/COT6936_S10.html https://online.cis.fiu.edu/portal/course/view.php?id=427 Nash Equilibria: Multicast Routing ¡ Multicast routing : Given directed graph G = (V, E) with edge costs c e ¡ 0, source node s, k agents located at terminal nodes t 1 , ..., t k . ¡ Agent j must construct path P j from node s to its terminal t j . ¡ Fair share. If x agents use edge e, they each pay c e / x. 3/25/10 COT 6936 2 Example ¡ Best response dynamics : Each agent is continually prepared to improve its solution in response to changes made by other agents ¡ Nash Equilibrium : When no agent has incentive to switch 3/25/10 COT 6936 3 1 2 1 pays 2 pays Outer Outer 4 8 Outer Middle 4 5+1 Middle Outer 5+1 8 Middle Middle 5/2 + 1 5/2 + 1 2 Multiple Nash Equilibria 3/25/10 COT 6936 4 Comparing Nash Equilibria: Price of Stability ¡ Social Optimum : Solution that optimizes...
View Full Document

This note was uploaded on 02/18/2012 for the course CIS 6936 taught by Professor Giri during the Spring '12 term at FIU.

Page1 / 5

LecXX2 - 1 COT 6936 1 COT 6936 Topics in Algorithms Giri...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online