|This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies.
For more information visit Aigaion.nl.|
|Type of publication:||Techreport|
|Title||Algorithmic Issues in Coalitional and Dynamic Network Games|
|Bibtex cite ID||RACTI-RU1-2006-5|
|Year published ||2006|
|Institution ||International Heinz Nixdorf Symposium on New Trends in Parallel & Distributed Computing (HNI 2006)|
We discuss some new algorithmic and complexity issues in
coalitional and dynamic/evolutionary games, related to the understand-
ing of modern sel¯sh and Complex networks.
In particular: (a) We examine the achievement of equilibria via natural
distributed and greedy approaches in networks. (b) We present a model
of a coalitional game in order to capture the anarchy cost and complexity
of constructing equilibria in such situations. (c) We propose a stochastic
approach to some kinds of local interactions in networks, that can be
viewed also as extensions of the classical evolutionary game theoretic