A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?"

Rodney Beard

MPRA Paper from University Library of Munich, Germany

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.

Keywords: Economics of language; Game theory; Complexity (search for similar items in EconPapers)
JEL-codes: C79 Z13 (search for similar items in EconPapers)
Date: 2001, Revised 2007-10
New Economics Papers: this item is included in nep-gth and nep-hpe
References: Add references at CitEc
Citations:

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/5377/1/MPRA_paper_5377.pdf original version (application/pdf)

Related works:
Working Paper: A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?" (2007)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:5377

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().