Cost Allocation Problems on Connection Networks

Cooperative games are mathematical models that can
be used to analyze the interaction among agents who
can obtain benefits by cooperating. This book mainly
deals with cooperative games which arise from
combinatorial optimization problems on weighted
graphs. These problems take place in the presence of
a group of agents, each of whom needs to be
connected directly or via other agents to a source
and the connections among agents are costly.
The goal of this book is to analyze allocation
methods which can also keep incentives for
cooperation under modifications in the structure of
the graph, as in the population of agents and
in the structure of weights. Examples of such
situations can be found in supply transportation
networks or telecommunication networks. The
allocation methods studied in this book can be
easily implemented in practical network situations,
are flexible to changes in the network situation,
and meet the requirement of continuous monitoring by
the agents involved.

Autorentext
Dr.Stefano Moretti graduated in Environmental Science in 1999 from the University of Genoa, Italy, and was awarded with a doctorate in Applied Mathematics in 2006. In 2008, he was also awarded with a Ph.D. degree at Tilburg University. Currently, he is a senior research fellow at the National Cancer Research Institute of Genoa, in Italy.

Klappentext
Cooperative games are mathematical models that can be used to analyze the interaction among agents who can obtain benefits by cooperating. This book mainly deals with cooperative games which arise from combinatorial optimization problems on weighted graphs. These problems take place in the presence of a group of agents, each of whom needs to be connected directly or via other agents to a source and the connections among agents are costly. The goal of this book is to analyze allocation methods which can also keep incentives for cooperation under modifications in the structure of the graph, as in the population of agents and in the structure of weights. Examples of such situations can be found in supply transportation networks or telecommunication networks. The allocation methods studied in this book can be easily implemented in practical network situations, are flexible to changes in the network situation, and meet the requirement of continuous monitoring by the agents involved.