Cost Allocation Problems on Connection Networks in an interactive cooperative setting » książka
Cost Allocation Problems on Connection Networks in an interactive cooperative setting
ISBN-13: 9783639115093 / Angielski / Miękka / 2008 / 164 str.
Cost Allocation Problems on Connection Networks in an interactive cooperative setting
ISBN-13: 9783639115093 / Angielski / Miękka / 2008 / 164 str.
(netto: 289,68 VAT: 5%)
Najniższa cena z 30 dni: 303,45
ok. 10-14 dni roboczych
Dostawa w 2026 r.
Darmowa dostawa!
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.
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.
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
