This is a Python application that performs an experiment on
Neighbourhood Maps, as explained in "Neighbourhood Maps:
Decentralized Ranking in small-world P2P networks.",
submitted for the "Concurrency and Computation: Practice and
Experience" journal, special issue for HotP2P '06.

To run the executable, experiment.py, the following is needed:

* Python >= 2.4 (http://www.python.org)
* bag.py, a recipe by Raymond Hettiger taken from the Python
Cookbook
(http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/259174)
* Pylab (http://matplotlib.sourceforge.net)
* networkx (http://networkx.lanl.gov)

To change the parameters, it is sufficient to provide
different parameters to the experiment() call at the end of
the file (e.g., for an n=100 nodes and a set of strategies of
Reciprocator, Cooperator and Defector, experiment(n=100,
strategies=[Reciprocator, Cooperator, Defector]).