References

  1. Abelson, H., Sussman, G. J., & Sussman, J. (1996). Structure and Interpretation of Computer Programs (2nd ed.). MIT Press. https://mitpress.mit.edu/9780262510875/
  2. Russell, S., & Norvig, P. (2021). Artificial Intelligence: A Modern Approach (4th ed.). Pearson. https://aima.cs.berkeley.edu/
  3. Sutton, R. S., & Barto, A. G. (2018). Reinforcement Learning: An Introduction (2nd ed.). MIT Press. http://incompleteideas.net/book/the-book-2nd.html
  4. Puterman, M. L. (1994). Markov Decision Processes. Wiley. https://onlinelibrary.wiley.com/doi/book/10.1002/9780470316887
  5. Bellman, R. (1957). Dynamic Programming. Princeton University Press. https://press.princeton.edu/books/hardcover/9780691651873/dynamic-programming
  6. Pearl, J. (2009). Causality (2nd ed.). Cambridge University Press. https://www.cambridge.org/core/books/causality/94D5B8E8B2A5E0D970AA4A8DE3A2F5DD
  7. Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998). Planning and acting in partially observable stochastic domains. AI, 101(1-2), 99-134. https://www.sciencedirect.com/science/article/pii/S000437029800023X
  8. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for A search. IEEE TSSC*, 4(2), 100-107. https://ieeexplore.ieee.org/document/4082128
  9. Fikes, R. E., & Nilsson, N. J. (1971). STRIPS. AI, 2(3-4), 189-208. https://www.sciencedirect.com/science/article/pii/0004370271900105
  10. Ghallab, M., Nau, D., & Traverso, P. (2004). Automated Planning. Elsevier. https://shop.elsevier.com/books/automated-planning/ghallab/978-1-55860-856-6
  11. Yao, S., et al. (2022). ReAct: Synergizing reasoning and acting in language models. https://arxiv.org/abs/2210.03629
  12. Schick, T., et al. (2023). Toolformer: Language models can teach themselves to use tools. https://arxiv.org/abs/2302.04761
  13. OpenAI. Function calling guide. https://platform.openai.com/docs/guides/function-calling
  14. Lewis, P., et al. (2020). Retrieval-augmented generation for knowledge-intensive NLP tasks. NeurIPS 2020. https://arxiv.org/abs/2005.11401
  15. Karpukhin, V., et al. (2020). Dense passage retrieval. EMNLP 2020. https://arxiv.org/abs/2004.04906
  16. Packer, C., et al. (2023). MemGPT: Towards LLMs as operating systems. https://arxiv.org/abs/2310.08560
  17. Wooldridge, M. (2009). An Introduction to MultiAgent Systems (2nd ed.). Wiley. https://www.wiley.com/en-us/An+Introduction+to+MultiAgent+Systems%2C+2nd+Edition-p-9780470519462
  18. Shoham, Y., & Leyton-Brown, K. (2009). Multiagent Systems. Cambridge University Press. https://www.cs.ubc.ca/~kevinlb/MAS/
  19. Nash, J. (1950). Equilibrium points in n-person games. PNAS, 36(1), 48-49. https://www.pnas.org/doi/10.1073/pnas.36.1.48
  20. Littman, M. L. (1994). Markov games as a framework for multi-agent RL. ICML 1994. https://www.cs.rutgers.edu/~mlittman/papers/ml94-final.pdf
  21. Silver, D., et al. (2016). Mastering the game of Go with deep neural networks and tree search. Nature, 529, 484-489. https://www.nature.com/articles/nature16961
  22. Oliehoek, F. A., & Amato, C. (2016). A Concise Introduction to Dec-POMDPs. Springer. https://link.springer.com/book/10.1007/978-3-319-28929-8
  23. Cambria, E., et al. (2025). Survey of LLM-based multi-agent systems. https://arxiv.org/abs/2402.01680
  24. Wu, Q., et al. (2023). AutoGen: Enabling next-gen LLM applications via multi-agent conversation. https://arxiv.org/abs/2308.08155
  25. Shazeer, N., et al. (2017). Outrageously large neural networks: The sparsely-gated mixture-of-experts layer. https://arxiv.org/abs/1701.06538
  26. Lakshminarayanan, B., Pritzel, A., & Blundell, C. (2017). Simple and scalable predictive uncertainty estimation using deep ensembles. NeurIPS 2017. https://arxiv.org/abs/1612.01474
  27. Minsky, M. (1988). The Society of Mind. Simon & Schuster. https://www.amazon.com/Society-Mind-Marvin-Minsky/dp/0671657135
  28. Kahneman, D. (2011). Thinking, Fast and Slow. Farrar, Straus and Giroux. https://us.macmillan.com/books/9780374533557/thinkingfastandslow
  29. Anthropic. (2022). Constitutional AI. https://arxiv.org/abs/2212.08073
  30. OpenAI. (2023). GPT-4 Technical Report. https://arxiv.org/abs/2303.08774
  31. WeasyPrint documentation. https://doc.courtbouillon.org/weasyprint/stable/
  32. GitHub Pages documentation. https://docs.github.com/pages
  33. Von Neumann, J., & Morgenstern, O. (1944). Theory of Games and Economic Behavior. Princeton University Press. https://press.princeton.edu/books/hardcover/9780691130613/theory-of-games-and-economic-behavior
  34. Savage, L. J. (1954). The Foundations of Statistics. Wiley. https://archive.org/details/foundationsofsta00sava
  35. Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27, 379-423, 623-656. https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf
  36. Kalman, R. E. (1960). A new approach to linear filtering and prediction problems. Journal of Basic Engineering, 82(1), 35-45. https://asmedigitalcollection.asme.org/fluidsengineering/article/82/1/35/397706/A-New-Approach-to-Linear-Filtering-and
  37. Li, L., Walsh, T. J., & Littman, M. L. (2006). Towards a unified theory of state abstraction for MDPs. ISAIM 2006. https://www.cs.rutgers.edu/~mlittman/papers/abstraction-06.pdf
  38. Ferns, N., Panangaden, P., & Precup, D. (2004). Metrics for finite Markov decision processes. UAI 2004. https://www.cs.mcgill.ca/~dprecup/publications/uai04.pdf
  39. Bertsekas, D. P. (2017). Dynamic Programming and Optimal Control (4th ed.). Athena Scientific. https://www.mit.edu/~dimitrib/dpbook.html
  40. Sutton, R. S., McAllester, D., Singh, S., & Mansour, Y. (1999). Policy gradient methods for reinforcement learning with function approximation. NeurIPS 1999. https://papers.nips.cc/paper/1713-policy-gradient-methods-for-reinforcement-learning-with-function-approximation.pdf
  41. Rawlings, J. B., Mayne, D. Q., & Diehl, M. M. (2017). Model Predictive Control: Theory, Computation, and Design (2nd ed.). Nob Hill. https://sites.engineering.ucsb.edu/~jbraw/mpc/
  42. Plotkin, G. D. (1981). A structural approach to operational semantics. Aarhus University technical report DAIMI FN-19. https://www.cs.tufts.edu/comp/150FP/archive/gordon-plotkin/sos.pdf
  43. Cousot, P., & Cousot, R. (1977). Abstract interpretation: A unified lattice model for static analysis. POPL 1977. https://dl.acm.org/doi/10.1145/512950.512973
  44. Dean, T., & Boddy, M. (1988). An analysis of time-dependent planning. AAAI 1988. https://cdn.aaai.org/AAAI/1988/AAAI88-003.pdf
  45. Kocsis, L., & Szepesvári, C. (2006). Bandit based Monte-Carlo planning. ECML 2006. https://link.springer.com/chapter/10.1007/11871842_29
  46. Robertson, S., & Zaragoza, H. (2009). The probabilistic relevance framework: BM25 and beyond. Foundations and Trends in IR, 3(4), 333-389. https://www.nowpublishers.com/article/Details/INR-019
  47. Malkov, Y. A., & Yashunin, D. A. (2018). Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE TPAMI, 42(4), 824-836. https://arxiv.org/abs/1603.09320
  48. Atkinson, R. C., & Shiffrin, R. M. (1968). Human memory: A proposed system and its control processes. In The Psychology of Learning and Motivation (Vol. 2). https://www.sciencedirect.com/science/article/pii/S0079742108604223
  49. Gneiting, T., & Raftery, A. E. (2007). Strictly proper scoring rules, prediction, and estimation. JASA, 102(477), 359-378. https://sites.stat.washington.edu/raftery/Research/PDF/Gneiting2007jasa.pdf
  50. Koh, P. W., & Liang, P. (2017). Understanding black-box predictions via influence functions. ICML 2017. https://arxiv.org/abs/1703.04730
  51. Altman, E. (1999). Constrained Markov Decision Processes. Chapman and Hall/CRC. https://www.routledge.com/Constrained-Markov-Decision-Processes/Altman/p/book/9781584883593
  52. Ames, A. D., Xu, X., Grizzle, J. W., & Tabuada, P. (2017). Control barrier function based quadratic programs for safety critical systems. IEEE TAC, 62(8), 3861-3876. https://doi.org/10.1109/TAC.2016.2638961
  53. NIST. (2023). Artificial Intelligence Risk Management Framework (AI RMF 1.0). https://www.nist.gov/itl/ai-risk-management-framework
  54. Lamport, L., Shostak, R., & Pease, M. (1982). The Byzantine generals problem. ACM TOPLAS, 4(3), 382-401. https://dl.acm.org/doi/10.1145/357172.357176
  55. Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985). Impossibility of distributed consensus with one faulty process. JACM, 32(2), 374-382. https://groups.csail.mit.edu/tds/papers/Lynch/jacm85.pdf
  56. Malone, T. W., & Crowston, K. (1994). The interdisciplinary study of coordination. ACM Computing Surveys, 26(1), 87-119. https://ccs.mit.edu/papers/CCSWP157/CCSWP157.html
  57. Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance, 16(1), 8-37. https://onlinelibrary.wiley.com/doi/10.1111/j.1540-6261.1961.tb02789.x
  58. Clarke, E. H. (1971). Multipart pricing of public goods. Public Choice, 11, 17-33. https://link.springer.com/article/10.1007/BF01726210
  59. Groves, T. (1973). Incentives in teams. Econometrica, 41(4), 617-631. https://www.jstor.org/stable/1914085
  60. Gibbard, A. (1973). Manipulation of voting schemes: A general result. Econometrica, 41(4), 587-601. https://www.jstor.org/stable/1914083
  61. Satterthwaite, M. A. (1975). Strategy-proofness and Arrow's conditions. Journal of Economic Theory, 10(2), 187-217. https://www.sciencedirect.com/science/article/pii/0022053175900502
  62. Smith, R. G. (1980). The contract net protocol. IEEE Transactions on Computers, C-29(12), 1104-1113. https://ieeexplore.ieee.org/document/1675516
  63. Brown, G. W. (1951). Iterative solution of games by fictitious play. In Activity Analysis of Production and Allocation. https://cowles.yale.edu/sites/default/files/files/pub/mon/m13-all.pdf
  64. Weibull, J. W. (1997). Evolutionary Game Theory. MIT Press. https://mitpress.mit.edu/9780262731218/evolutionary-game-theory/
  65. Hart, S., & Mas-Colell, A. (2000). A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68(5), 1127-1150. https://www.ma.huji.ac.il/hart/abs/adapt.html
  66. Krogh, A., & Vedelsby, J. (1995). Neural network ensembles, cross validation, and active learning. NeurIPS 1994. https://papers.nips.cc/paper/1001-neural-network-ensembles-cross-validation-and-active-learning.pdf
  67. Dietterich, T. G. (2000). Ensemble methods in machine learning. MCS 2000. https://link.springer.com/chapter/10.1007/3-540-45014-9_1
  68. Jacobs, R. A., Jordan, M. I., Nowlan, S. J., & Hinton, G. E. (1991). Adaptive mixtures of local experts. Neural Computation, 3(1), 79-87. https://www.cs.toronto.edu/~hinton/absps/jjnh91.pdf
  69. Fedus, W., Zoph, B., & Shazeer, N. (2022). Switch Transformers: Scaling to trillion parameter models with simple and efficient sparsity. JMLR, 23(120), 1-39. https://www.jmlr.org/papers/v23/21-0998.html
  70. Ross, S., Gordon, G. J., & Bagnell, J. A. (2011). A reduction of imitation learning and structured prediction to no-regret online learning. AISTATS 2011, 627-635. https://proceedings.mlr.press/v15/ross11a.html
  71. Ouyang, L., et al. (2022). Training language models to follow instructions with human feedback. https://arxiv.org/abs/2203.02155
  72. Levine, S., Kumar, A., Tucker, G., & Fu, J. (2020). Offline reinforcement learning: Tutorial, review, and perspectives on open problems. https://arxiv.org/abs/2005.01643
  73. Kumar, A., Zhou, A., Tucker, G., & Levine, S. (2020). Conservative Q-learning for offline reinforcement learning. NeurIPS 2020. https://proceedings.neurips.cc/paper/2020/hash/0d2b2061826a5df3221116a5085a6052-Abstract.html
  74. Finn, C., Abbeel, P., & Levine, S. (2017). Model-agnostic meta-learning for fast adaptation of deep networks. ICML 2017, 1126-1135. https://proceedings.mlr.press/v70/finn17a.html
  75. Stiennon, N., et al. (2020). Learning to summarize from human feedback. https://arxiv.org/abs/2009.01325
  76. Vaswani, A., et al. (2017). Attention is all you need. NeurIPS 2017. https://arxiv.org/abs/1706.03762
  77. Amodei, D., et al. (2016). Concrete problems in AI safety. https://arxiv.org/abs/1606.06565
  78. Christiano, P. F., et al. (2017). Deep reinforcement learning from human preferences. NeurIPS 2017. https://arxiv.org/abs/1706.03741
  79. Sudhir, A. P., Kaunismaa, J., & Panickssery, A. (2025). A benchmark for scalable oversight protocols. https://arxiv.org/abs/2504.03731
  80. Doyle, A. C. (1892). The Adventures of Sherlock Holmes. Project Gutenberg. https://dev.gutenberg.org/cache/epub/48320/pg48320-images.html
  81. Aristotle. (c. 340 BCE). Nicomachean Ethics. Project Gutenberg. https://www.gutenberg.org/cache/epub/8438/pg8438.html
  82. Bacon, F. (1605). The Advancement of Learning. Project Gutenberg. https://www.gutenberg.org/files/5500/5500-h/5500-h.htm
  83. Hume, D. (1748). An Enquiry Concerning Human Understanding. Project Gutenberg. https://www.gutenberg.org/files/9662/9662-h/9662-h.htm
  84. Whewell, W. (1858). History of Scientific Ideas (3rd ed., Vol. 1). Project Gutenberg. https://www.gutenberg.org/files/69093/69093-h/69093-h.htm
  85. James, W. (1890). The Principles of Psychology (Vol. 1). Project Gutenberg. https://www.gutenberg.org/files/57628/57628-h/57628-h.htm
  86. Bacon, F. (1620). Novum Organum. Project Gutenberg. https://www.gutenberg.org/files/45988/45988-h/45988-h.htm
  87. Carroll, L. (1865). Alice's Adventures in Wonderland. Project Gutenberg. https://www.gutenberg.org/cache/epub/11/pg11-images.html
  88. Lovelace, A. A. (1843). Notes by the translator. In L. F. Menabrea, Sketch of the Analytical Engine invented by Charles Babbage. Scientific Memoirs, 3, 666-731. https://hsm.ox.ac.uk/imagining-ai
  89. Clausewitz, C. von. (1832). On War. Project Gutenberg. https://www.gutenberg.org/files/1946/1946-h/1946-h.htm
  90. Hobbes, T. (1651). Leviathan. Project Gutenberg. https://www.gutenberg.org/files/73957/73957-h/73957-h.htm
  91. Hobbes, T. (1650). Human Nature. Project Gutenberg. https://www.gutenberg.org/files/74236/74236-h/74236-h.htm
  92. Carlyle, T. (1836). Sartor Resartus. Project Gutenberg. https://www.gutenberg.org/files/20585/20585-h/20585-h.htm
  93. Boswell, J. (1791). The Life of Samuel Johnson. Project Gutenberg. https://www.gutenberg.org/files/1564/1564-h/1564-h.htm
  94. Bacon, F. (1625). Essays. Project Gutenberg. https://www.gutenberg.org/cache/epub/56463/pg56463-images.html
  95. Burke, E. (1771, February 7). Speech Relative to the Middlesex Election. Quotation reproduced in the official report of the Parliament of the United Kingdom. https://hansard.parliament.uk/lords/1975-04-16/debates/7cf9e3ff-6d2b-4065-b7ba-825490390fce/MultinationalCorporations
  96. Mill, J. S. (1859). On Liberty. Project Gutenberg. https://www.gutenberg.org/files/34901/34901-h/34901-h.htm
  97. Aristotle. (c. 350 BCE). Politics. Project Gutenberg. https://www.gutenberg.org/files/6762/6762-h/6762-h.htm
  98. Smith, A. (1776). An Inquiry into the Nature and Causes of the Wealth of Nations. Project Gutenberg. https://www.gutenberg.org/files/38194/38194-h/38194-h.htm
  99. Hume, D. (1739). A Treatise of Human Nature. Project Gutenberg. https://www.gutenberg.org/files/4705/4705-h/4705-h.htm
  100. Newton, I. (1675, February 5). Letter to Robert Hooke. Institutional transcription hosted by York University. https://www.yorku.ca/menary/courses/phys1000/newton_quotes.pdf

“If I have seen further it is by standing on ye sholders of Giants.”

— Isaac Newton, Letter to Robert Hooke (1675), Letter of 5 February 1675 (Old Style).

Agent-427 and Mira follow a trail of footnotes into a vast library whose shelves continue beyond the frame.