×

A probabilistic model for the interaction of an agent with a network environment. (English. Russian original) Zbl 1333.93040

Cybern. Syst. Anal. 51, No. 6, 835-848 (2015); translation from Kibern. Sist. Anal. 2015, No. 6, 3-18 (2015).
Summary: This paper elaborates and analyzes a general discrete non-stationary probabilistic model for the interaction of an agent with a counteracting layered network environment. The proposed model is represented as a composition of two probabilistic finite automata with a variable structure. This composition of automata is a two-person game in which the player that makes a move inflicts damage on the opponent.

MSC:

93A30 Mathematical modelling of systems (MSC2010)
93B12 Variable structure systems
93E03 Stochastic systems in control theory (general)
91A05 2-person games
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] C. Hewitt, “PLANNER: A language for proving theorems in robots,” in: Proc. 1st Intern. Joint Conf. on AI (IJCAI-69), Washington (1969), pp. 295-301. · Zbl 1205.91040
[2] C. Hewitt, P. Bishop, and R. Steiger, “A universal modular ACTOR formalism for artificial intelligence,” in: Proc. 3rd Intern. Joint Conf. on AI (IJCAI-73), Stanford (1973), pp. 235-245. · Zbl 1081.68045
[3] M. L. Tsetlin, Investigations on the Automata Theory and Modeling of Biological Systems [in Russian], Nauka, Moscow (1969). · Zbl 0226.68042
[4] L. Vogel, A. Owens, and M. Walsh, Artificial Intelligence and Evolutionary Modeling [Russian translation], Mir, Moscow (1969).
[5] V. I. Varshavskii, Collective Behavior of Automata [in Russian], Nauka, Moscow (1973).
[6] V. G. Sragovich, Theory of Adaptive Systems [in Russian], Nauka, Moscow (1976).
[7] D. B. Lenat, “On automated scientific theory formation: A case study using the AM program,” Machine Intelligence, 9, 251-256 (1977).
[8] V. R. Lesser and J. C. Wileden, “Issues in the design of tools for distributed software system development,” in: W. E. Riddle and R. Fairley (eds.), Software Development Tools, Springer (1980), pp. 1104-1113.
[9] Y. Shoham, “Agent-oriented programming,” Artificial Intelligence, 60, No. 1, 51-92 (1993). · doi:10.1016/0004-3702(93)90034-9
[10] G. Vogiatzis, I. MacGillivray, and M. Chli, “A probabilistic model for trust and reputation,” in: Proc. 9th Intern. Conf. on Autonomous Agents and Multiagent Systems (2010), pp. 225-232.
[11] M. A. Kondratyev, “Forecasting methods and models of disease spread,” Computer Research and Modeling, No. 5, 863-882 (2013).
[12] A. V. Timofeev and A. V. Syrtzev, Models and Methods for Data Flows Routing in Dynamical Telecommunication Systems [in Russian], New Technologies, Moscow (2005).
[13] N. Alon, M. Feldman, A. D. Procaccia, and M. Tennenholtz, “A note on competitive diffusion through social networks,” Information Processing Letters, No. 6, 221-225 (2010). · Zbl 1197.91057
[14] Formal Approaches to Agent-Based Systems, Lecture Notes in Artificial Intelligence, 3228, Springer, Berlin-Heidelberg (2005).
[15] P. Fraigniaud, D. Ilcinkas, G. Peer, et al., “Graph exploration by a finite automaton,” Theor. Comput. Sci., 345, Nos. 2-3, 331-344 (2005). · Zbl 1081.68045 · doi:10.1016/j.tcs.2005.07.014
[16] E. Kranakis, D. Krizanc, and S. Rajsbaum, “Mobile agent rendezvous: A survey,” LNCS, 4056, 1-9 (2006).
[17] S. Abbas, M. Mosbah, and A. Zemmari, “A probabilistic model for distributed merging of mobile agents,” in: Proc. 2nd Intern. Workshop on Verification and Evaluation of Computer and Communication Systems (2008), pp. 1-10. · Zbl 1218.90032
[18] A. X. Jiang, K. Leyton-Brown, and N. A. R. Bhat, “Action-graph games,” Games and Economic Behavior, 71, 141-173 (2010). · Zbl 1205.91040 · doi:10.1016/j.geb.2010.10.012
[19] D. A. Pospelov, “From a collective of automata to multiagent systems,” in: Proc. Intern. Workshop “Distributed Artificial Intelligence and Multi-Agent Systems,” St. Petersburg (1997), pp. 319-325.
[20] A. Bianco and L. de Alfaro, “Model checking of probabilistic and nondeterministic systems,” LNCS, 1026, 499-513 (1995). · Zbl 1354.68167
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.