Beard, Rodney (2001): A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?".
Download (3486Kb) | Preview
This note examines the complexity of complete transitive binary relations or tournaments using Kolmogorov complexity. The complexity of tournaments calculated using Kolmogorov complexity is then compared to minimally complex tournaments defined in terms of the minimal number of examples needed to describe the tournament. The latter concept is the concept of complexity employed by Rubinstein  in his economic theory of language. A proof of Rubinsein's conjecture on the complexity bound of natural language tournaments is provided.
|Item Type:||MPRA Paper|
|Institution:||University of Alberta|
|Original Title:||A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?"|
|Keywords:||Economics of language; Game theory; Complexity|
|Subjects:||Z - Other Special Topics > Z1 - Cultural Economics; Economic Sociology; Economic Anthropology > Z13 - Economic Sociology; Economic Anthropology; Social and Economic Stratification
C - Mathematical and Quantitative Methods > C7 - Game Theory and Bargaining Theory > C79 - Other
|Depositing User:||Rodney Beard|
|Date Deposited:||19. Oct 2007|
|Last Modified:||19. Feb 2013 15:47|