This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner’s dilemma with coalition formation. The ...
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Recursive reasoning of the form what do I think that you think that I think (and so on) arises often while acting rationally in multiagent settings. Several multiagent decision-ma...
We control a population of interacting software agents. The agents have a strategy, and receive a payoff for executing that strategy. Unsuccessful agents become extinct. We investi...
— The problem of jamming plays an important role in ensuring the quality and security of wireless communications, especially at this moment when wireless networks are quickly bec...
Eitan Altman, Konstantin Avrachenkov, Andrey Garna...