A Network Dispersion Problem for Non-communicating Agents

Martin N. Simanjuntak

Abstract

Alpern and Reyniers (2002) initiated the study of spatial dispersion of agents in the context of non-communicating agents who could move between any two locations, based only on the knowledge of the populations at all locations. The research problem addressed in this paper is to see how the problem of Alpern and Reyniers changes if a network (graph) structure is imposed on the set of locations: An agent only knows the population at his current node (location) and he can only stay still or move to an adjacent node. He can see the number of arcs at his node, but if he moves he must choose among them equiprobably. As we are dealing with non-communicating agents with limited amount of global knowledge, we shall limit our discussion to simple and myopic strategies. In particular, our agents adopt common (Markovian) stunted random walk strategy, completely specified by the probability p of staying still for another period at the same node. Given such strategies, how long will it take, on average, for the agents to achieve dispersion? Our objective is to determine the minimum dispersal time and optimal levels of p for several classes of networks, including line networks, cycle networks, and complete graphs.

References

  1. Alpern, S., Gal, S., 2003. The theory of search games and rendezvous. Kluwer Academic Publishers, Boston.
  2. Alpern, S., Reyniers, D., 2002. Spatial Dispersion as a Dynamic Coordination Problem. Theory Decis. 53, 29-59.
  3. Arthur, W. B., 1994. Inductive Reasoning and Bounded Rationality. Am. Econ. Rev. 84, 406-411.
  4. Azar, Y., Broder, A., Karlin, A., Upfal, E., 1999. Balanced Allocations. SIAM J. Comput. 29, 180-200.
  5. Challet, D., Zhang, Y.-C., 1997. Emergence of cooperation and organization in an evolutionary game. Phys. A Stat. Mech. its Appl. 246, 407-418.
  6. Fretwell, S. D., Lucas Jr., H. L., 1969. On territorial behavior and other factors influencing habitat distribution in birds. Acta Biotheor. 19, 16-36.
  7. Galceran, E., Carreras, M., 2013. A survey on coverage path planning for robotics. Rob. Auton. Syst. 61, 1258- 1276.
  8. Grenager, T., Powers, R., Shoham, Y., 2002. Dispersion games: general definitions and some specific learning results, in: AAAI-02 Proceedings. pp. 398-403.
  9. Grinstead, C. M., Snell, J.L., 1997. Introduction to Probability, 2nd ed., 2nd rev. e. ed. American Mathematical Society.
  10. Houston, A., McNamara, J., 1997. Patch choice and population size. Evol. Ecol. 11, 703-722.
  11. Qiu, L., Yang, Y. R., Zhang, Y., Shenker, S., 2003. On Selfish Routing in Internet-like Environments, in: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. ACM, New York, NY, USA, pp. 151-162.
  12. Rosenthal, R. W., 1973. A class of games possessing purestrategy Nash equilibria. Int. J. Game Theory 2, 65- 67.
Download


Paper Citation


in Harvard Style

N. Simanjuntak M. (2014). A Network Dispersion Problem for Non-communicating Agents . In Doctoral Consortium - DCAART, (ICAART 2014) ISBN Not Available, pages 66-72


in Bibtex Style

@conference{dcaart14,
author={Martin N. Simanjuntak},
title={A Network Dispersion Problem for Non-communicating Agents},
booktitle={Doctoral Consortium - DCAART, (ICAART 2014)},
year={2014},
pages={66-72},
publisher={SciTePress},
organization={INSTICC},
doi={},
isbn={Not Available},
}


in EndNote Style

TY - CONF
JO - Doctoral Consortium - DCAART, (ICAART 2014)
TI - A Network Dispersion Problem for Non-communicating Agents
SN - Not Available
AU - N. Simanjuntak M.
PY - 2014
SP - 66
EP - 72
DO -