Andere Kunden interessierten sich auch für
![Towards Efficient Resource Allocation in Desktop Grid Systems]( "Towards Efficient Resource Allocation in Desktop Grid Systems")
Towards Efficient Resource Allocation in Desktop Grid Systems47,95 €![Computer program development for house cost calculation]( "Computer program development for house cost calculation")
Computer program development for house cost calculation32,99 €![Reputation Based Job Allocation in Computational Grid]( "Reputation Based Job Allocation in Computational Grid")
Reputation Based Job Allocation in Computational Grid32,99 €![Resource Allocation In Next Generation Internet]( "Resource Allocation In Next Generation Internet")
Resource Allocation In Next Generation Internet32,99 €![A Low-Cost Platform For Peer-To-Peer Mobile Wireless Networks]( "A Low-Cost Platform For Peer-To-Peer Mobile Wireless Networks")
A Low-Cost Platform For Peer-To-Peer Mobile Wireless Networks32,99 €![Cost and Energy Efficient Hybrid Wireless Optical Networks]( "Cost and Energy Efficient Hybrid Wireless Optical Networks")
Cost and Energy Efficient Hybrid Wireless Optical Networks26,99 €![Efficient Workload Allocation in Fog-Cloud Networks]( "Efficient Workload Allocation in Fog-Cloud Networks")
Efficient Workload Allocation in Fog-Cloud Networks29,99 €
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.
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.