Path coalitional games

Details Path coalitional games Path coalitional games

2011-03-16

arxiv.org/abs/1103.3310v2

Computer Science

Computer Science and Game Theory

15 pages; To be presented at The Second Workshop on Cooperative Games in Multiagent Systems (COOPMAS 2011)

Scientific paper

We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an s-t path. We present polynomial-time algorithms to compute and verify least core payoffs of cost-based generalizations of path coalitional games and their duals, thereby settling a number of open problems. The least core payoffs of path coalitional games are completely characterized and a polynomial-time algorithm for computing the nucleolus of edge path coalitional games on undirected series-parallel graphs is presented.

Affiliated with

Also associated with

No associations

Rating

Path coalitional games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Path coalitional games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Path coalitional games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-247294