Fair Cost Sharing Network Creation Game
1
 Given:
 G = (V, E),
 costs ce for all e є E,
2
3
 Each player is a source-
sink pair.
 Each player wants to
build links to connect its
source to its sink.
 But players that use an
edge must pay for it!
1
5
8
5
4
1
2
2
5
1
Fair Cost Sharing Network Creation Game
2
 The cost of an edge is
shared evenly among
players using that edge.
 Each player’s goal is to
connect its vertex-pair as
cheaply as possible.
 Global objective:
minimize total cost of
edges needed to connect
all pairs.
2
3
1
5
8
5
4
1
2
2
5
1