Back to Results
First PageMeta Content
Game theory / Network flow / Mathematics / Subgame perfect equilibrium / Maximum flow problem


CPSCECON, Fall 2011 Solution Set for Exam 2 Question 1: (a) Let G = (V, E, t) be a trust graph, as the term is defined in Section 27.5, and let v0 be a distinguished “start node.” See “Definitio
Add to Reading List

Document Date: 2011-12-22 14:05:18


Open Document

File Size: 213,90 KB

Share Result on Facebook