Beard, Rodney (2001): A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?".
This is the latest version of this item.

PDF
MPRA_paper_5795.pdf Download (616Kb)  Preview 
Abstract
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 [6] 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 

Original Title:  A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?" 
Language:  English 
Keywords:  Economics of language, Binary relations, Tournaments 
Subjects:  C  Mathematical and Quantitative Methods > C7  Game Theory and Bargaining Theory > C79  Other Z  Other Special Topics > Z0  General > Z00  General 
Item ID:  5795 
Depositing User:  Rodney Beard 
Date Deposited:  17. Nov 2007 04:53 
Last Modified:  19. Feb 2013 18:15 
URI:  http://mpra.ub.unimuenchen.de/id/eprint/5795 
Available Versions of this Item
 A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?". (deposited 17. Nov 2007 04:53) [Currently Displayed]