Deriving structural theorems and methods using Tellegen's theorem and combinatorial representations

2001 ◽  
Vol 38 (44-45) ◽  
pp. 8037-8052 ◽  
Author(s):  
O. Shai
2019 ◽  
Vol 10 (1) ◽  
pp. 24-45
Author(s):  
Samuel Allen Alexander

Abstract 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.


2019 ◽  
Vol 114 (1-2) ◽  
pp. 1-18 ◽  
Author(s):  
Lenny Neyt ◽  
Jasson Vindas
Keyword(s):  

2013 ◽  
Vol 120 (3) ◽  
pp. 671-682 ◽  
Author(s):  
Peter J. Cameron ◽  
Maximilien Gadouleau ◽  
Søren Riis

Sign in / Sign up

Export Citation Format

Share Document