(* The Minimum Cost Spanning Tree Problem *)



<<Pricing`



c = Table[Random[Integer, {1, 5}], {5}, {5}]

M = c + Transpose[c] - IdentityMatrix[5] (c + Transpose[c])

game7 = SpanningTreeGame[M]

Core[game7]



A = Table[Random[Integer, {1, 5}], {2}, {2}]

StableAssignments[A]

game8 = AssignmentGame[A]

Core[Dual[game8]]