Walter Kern — Matching Games
|Time:||Wednesday, November 28, 2012|
|Location:||Room 311, Citadel|
A matching game is a cooperative game defined on a (weighted) graph G=(V, E). The players are the nodes and the value v(S) of a subset ("coalition") of nodes S ⊆ V is the maximum size (weight) of a matching in G[S], the subgraph induced by S. We discuss some "solution concepts", i.e., different ways to allocate the total gain (=size/weight of a max matching in G) among the individual players.