{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T21:50:35Z","timestamp":1777585835861,"version":"3.51.4"},"reference-count":16,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Legg and Hutter, as well as subsequent authors, considered intelligent agents through the lens of interaction with reward-giving environments, attempting to assign numeric intelligence measures to such agents, with the guiding principle that a more intelligent agent should gain higher rewards from environments in some aggregate sense. In this paper, we consider a related question: rather than measure numeric intelligence of one Legg-Hutter agent, how can we compare the relative intelligence of two Legg-Hutter agents? We propose an elegant answer based on the following insight: we can view Legg-Hutter agents as candidates in an election, whose voters are environments, letting each environment vote (via its rewards) which agent (if either) is more intelligent. This leads to an abstract family of comparators simple enough that we can prove some structural theorems about them. It is an open question whether these structural theorems apply to more practical intelligence measures.<\/jats:p>","DOI":"10.2478\/jagi-2019-0003","type":"journal-article","created":{"date-parts":[[2019,11,9]],"date-time":"2019-11-09T04:30:25Z","timestamp":1573273825000},"page":"24-45","source":"Crossref","is-referenced-by-count":3,"title":["Intelligence via ultrafilters: structural properties of some intelligence comparators of deterministic Legg-Hutter agents"],"prefix":"10.2478","volume":"10","author":[{"given":"Samuel Allen","family":"Alexander","sequence":"first","affiliation":[{"name":"Quantitative Research Analyst The U.S. Securities and Exchange Commission New York Regional Office"}]}],"member":"374","published-online":{"date-parts":[[2019,11,8]]},"reference":[{"key":"2026042814171552977_j_jagi-2019-0003_ref_001_w2aab3b7b2b1b6b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"Alexander, S. A. 2013. Infinite graphs in systematic biology, with an application to the species problem. Acta Biotheoretica 61(2):181\u2013201.10.1007\/s10441-012-9168-y","DOI":"10.1007\/s10441-012-9168-y"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_002_w2aab3b7b2b1b6b1ab1ab2Aa","unstructured":"Balduzzi, D.; Tuyls, K.; Perolat, J.; and Graepel, T. 2018. Re-evaluating evaluation. In Advances in Neural Information Processing Systems, 3268\u20133279."},{"key":"2026042814171552977_j_jagi-2019-0003_ref_003_w2aab3b7b2b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"Fishburn, P. C. 1970. Arrow\u2019s impossibility theorem: Concise proof and infinite voters. Journal of Economic Theory 2(1):103\u2013106.10.1016\/0022-0531(70)90015-3","DOI":"10.1016\/0022-0531(70)90015-3"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_004_w2aab3b7b2b1b6b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"Gavane, V. 2013. A measure of real-time intelligence. Journal of Artificial General Intelligence 4(1):31\u201348.10.2478\/jagi-2013-0003","DOI":"10.2478\/jagi-2013-0003"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_005_w2aab3b7b2b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"Good, I. J. 1955. On the marking of chess-players. The Mathematical Gazette 39(330):292\u2013296.10.2307\/3608567","DOI":"10.2307\/3608567"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_006_w2aab3b7b2b1b6b1ab1ab6Aa","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez-Orallo, J., and Dowe, D. L. 2010. Measuring universal intelligence: Towards an anytime intelligence test. Artificial Intelligence 174(18):1508\u20131539.10.1016\/j.artint.2010.09.006","DOI":"10.1016\/j.artint.2010.09.006"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_007_w2aab3b7b2b1b6b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"Hibbard, B. 2011. Measuring agent intelligence via hierarchies of environments. In International Conference on Artificial General Intelligence, 303\u2013308. Springer.10.1007\/978-3-642-22887-2_34","DOI":"10.1007\/978-3-642-22887-2_34"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_008_w2aab3b7b2b1b6b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"Kirman, A. P., and Sondermann, D. 1972. Arrow\u2019s theorem, many agents, and invisible dictators. Journal of Economic Theory 5(2):267\u2013277.10.1016\/0022-0531(72)90106-8","DOI":"10.1016\/0022-0531(72)90106-8"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_009_w2aab3b7b2b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"Legg, S., and Hutter, M. 2007. Universal intelligence: A definition of machine intelligence. Minds and machines 17(4):391\u2013444.10.1007\/s11023-007-9079-x","DOI":"10.1007\/s11023-007-9079-x"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_010_w2aab3b7b2b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"Legg, S., and Veness, J. 2013. An approximation of the universal intelligence measure. In Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence. Springer. 236\u2013249.10.1007\/978-3-642-44958-1_18","DOI":"10.1007\/978-3-642-44958-1_18"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_011_w2aab3b7b2b1b6b1ab1ac11Aa","unstructured":"Leike, J., and Hutter, M. 2015. Bad universal priors and notions of optimality. Journal of Machine Learning Research 40:1244\u20131259."},{"key":"2026042814171552977_j_jagi-2019-0003_ref_012_w2aab3b7b2b1b6b1ab1ac12Aa","unstructured":"Morreau, M. 2016. Arrow\u2019s Theorem. In Zalta, E. N., ed., The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, winter 2016 edition."},{"key":"2026042814171552977_j_jagi-2019-0003_ref_013_w2aab3b7b2b1b6b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"Okasha, S. 2011. Theory choice and social choice: Kuhn versus Arrow. Mind 120(477):83\u2013 115.10.1093\/mind\/fzr010","DOI":"10.1093\/mind\/fzr010"},{"key":"2026042814171552977_j_jagi-2019-0003_ref_014_w2aab3b7b2b1b6b1ab1ac14Aa","unstructured":"Plato. 1997. Philebus. In Cooper, J. M.; Hutchinson, D. S.; et al., eds., Plato: complete works. Hackett Publishing."},{"key":"2026042814171552977_j_jagi-2019-0003_ref_015_w2aab3b7b2b1b6b1ab1ac15Aa","unstructured":"Sanghi, P., and Dowe, D. L. 2003. A computer program capable of passing IQ tests. In 4th Intl. Conf. on Cognitive Science (ICCS03), Sydney, 570\u2013575."},{"key":"2026042814171552977_j_jagi-2019-0003_ref_016_w2aab3b7b2b1b6b1ab1ac16Aa","doi-asserted-by":"crossref","unstructured":"Stegenga, J. 2013. An impossibility theorem for amalgamating evidence. Synthese 190(12):2391\u20132411.10.1007\/s11229-011-9973-x","DOI":"10.1007\/s11229-011-9973-x"}],"container-title":["Journal of Artificial General Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/content.sciendo.com\/view\/journals\/jagi\/10\/1\/article-p24.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/reference-global.com\/pdf\/10.2478\/jagi-2019-0003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T20:02:30Z","timestamp":1777406550000},"score":1,"resource":{"primary":{"URL":"https:\/\/reference-global.com\/article\/10.2478\/jagi-2019-0003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":16,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,11,8]]},"published-print":{"date-parts":[[2019,1,1]]}},"alternative-id":["10.2478\/jagi-2019-0003"],"URL":"https:\/\/doi.org\/10.2478\/jagi-2019-0003","relation":{},"ISSN":["1946-0163"],"issn-type":[{"value":"1946-0163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}