Communication-Free Interactions among Rational Agents: A Probabilistic Approach
Distributed Artificial Intelligence, 1989
Abstract Recent work on interactions among rational agents has put forward a computationally trac... more Abstract Recent work on interactions among rational agents has put forward a computationally tractable, deduction-based scheme for automated agents to use in analyzing multiagent encounters. While the theory has defined irrational actions, it has underconstrained an agent's choices: there are many situations where an agent in the previous framework was faced with several potentially rational actions, and no way of choosing among them. This paper presents a probabilistic extension to the previous framework of Genesereth, Ginsberg, and Rosenschein [Genesereth et al. 1986] that provides agents with a mechanism for further refining their choice of rational moves. At the same time, it maintains the computational attractiveness of the previous approach. The probabilistic extension is explicitly representing uncertainty about other players' moves. A three-level hierarchy of rationality is defined, corresponding to ordinal, stochastic, and utility dominance among alternative outcomes. The previous deduction-based formalism is recast in probabilistic terms and is seen to be a particular special case of a more encompassing dominance theory. A technique is presented for using the dominance ideas in interactions with other agents operating under various types of rationality.
Uploads
Papers by John S Breese