## Managing Complexity: Insights, Concepts, ApplicationsDirk Helbing Springer, 13/10/2007 - 393 páginas Each chapter in Managing Complexity focuses on analyzing real-world complex systems and transferring knowledge from the complex-systems sciences to applications in business, industry and society. The interdisciplinary contributions range from markets and production through logistics, traffic control, and critical infrastructures, up to network design, information systems, social conflicts and building consensus. They serve to raise readers' awareness concerning the often counter-intuitive behavior of complex systems and to help them integrate insights gained in complexity research into everyday planning, decision making, strategic optimization, and policy. Intended for a broad readership, the contributions have been kept largely non-technical and address a general, scientifically literate audience involved in corporate, academic, and public institutions. |

### No interior do livro

Resultados 1-5 de 52

...

**random**null model. A theoretical expectation for the average number of neighbors in the bidder network is given by 〈k〉= 2(〈b) − 1)〈a〉= 14 where 〈b〉 is the average number of bidders per auction and 〈a〉 is the average number of ...

...

**random**null model (RNM) obtained by reshuffling the bidders in different auctions and the reduced version of the network used for cluster analysis containing only those bidders having taken part in more than one auction data RNM reduced ...

...

**random**assignment of bidders into groups of the same size and degree distribution and is given by [mss] = from members K2s of /4M. group By s, K while s we denote the total number of links emanating M is the total number of links in the ...

...

**random**. The order of the groups was chosen to optimally show the correspondence between the ordering resulting from the γ = 0.5 and the γ = 1 ordering. In this representation, link densities correspond to pixel densities and thus to ...

...

**random**graphs will cluster into equal sized communities and calculate that a

**random**graph with the same number of nodes and links, i.e. disregarding the scale free degree distribution and the affiliation network structure of the graph ...

### Índice

1 | |

18 | |

Managing Autonomy and Control in Economic Systems | 37 |

The Illusion of Control | 57 |

Benefits and Drawbacks of Simple Models for Complex | 89 |

Coping with Nonlinearity and Complexity | 119 |

Repeated Auction Games and Learning Dynamics | 137 |

Decentralized Approaches to Adaptive Traffic Control | 177 |

Stefano Battiston Domenico Delli Gatti Mauro Gallegati 219 | 241 |

Bootstrapping the Long Tail in Peer to Peer Systems | 262 |

Complexity in Human Conflict | 303 |

Fostering Consensus in Multidimensional Continuous Opinion | 321 |

MultiStakeholder Governance Emergence | 335 |

Evolutionary Engineering of Complex Functional Networks | 350 |

Julian Sienkiewicz Agata Fronczak Piotr Fronczak Krzysztof | 369 |

Index | 389 |

Arne Kesting Martin Schönhof Stefan Lämmer Martin Treiber | 201 |

Trade Credit Networks and Systemic Risk | 218 |

### Outras edições - Ver tudo

Managing Complexity: Insights, Concepts, Applications Dirk Helbing Pré-visualização indisponível - 2007 |

Managing Complexity: Insights, Concepts, Applications Dirk Helbing Pré-visualização indisponível - 2010 |