Abstract
Game theory treats players as special: A description of a game contains a full, explicit enumeration of all players. This isn’t a realistic assumption for autonomous intelligent agents. In this paper, we propose a framework in which agents and their environments are both modelled as probablistic oracle machines with access to a “reflective” oracle, which is able to answer questions about the outputs of other machines with access to the same oracle. These oracles avoid diagonalization problems by answering some queries randomly. Agents make decisions by asking the oracle questions about their environment, which they model as an arbitrary oracle machines. Since agents are themselves oracle machines, the environment can contain other agents as non-distinguished subprocesses, removing the special treatment of players in the classical theory. We show that agents interacting in this way play Nash equilibria.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Binmore, K.: Modeling rational players: Part I. Economics and Philosophy 3(02), 179–214 (1987)
Fallenstein, B., Soares, N., Taylor, J.: Reflective variants of Solomonoff induction and AIXI. In: Bieger, J., Goertzel, B., Potapov, A. (eds.) AGI 2015. LNCS, vol. 9205, pp. 60–69. Springer, Heidelberg (2015)
Fallenstein, B., Taylor, J., Christiano, P.: Reflective oracles: A foundation for classical game theory. Tech. rep., Machine Intelligence Research Institute (2015), http://intelligence.org/files/ReflectiveOracles.pdf
Hutter, M.: Universal Artificial Intelligence. Texts in Theoretical Computer Science. Springer (2005)
Kreps, D.M.: A Course in Microeconomic Theory. Princeton University Press (1990)
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill (1967)
Solomonoff, R.J.: A formal theory of inductive inference. Part I 7(1), 1–22 (1964)
Weirich, P.: Causal decision theory. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fallenstein, B., Taylor, J., Christiano, P.F. (2015). Reflective Oracles: A Foundation for Game Theory in Artificial Intelligence. In: van der Hoek, W., Holliday, W., Wang, Wf. (eds) Logic, Rationality, and Interaction. LORI 2015. Lecture Notes in Computer Science(), vol 9394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48561-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-662-48561-3_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48560-6
Online ISBN: 978-3-662-48561-3
eBook Packages: Computer ScienceComputer Science (R0)
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.