IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/5795.html
   My bibliography  Save this paper

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

Author

Listed:
  • Beard, Rodney

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.

Suggested Citation

  • Beard, Rodney, 2001. "A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?"," MPRA Paper 5795, University Library of Munich, Germany, revised 16 Nov 2007.
  • Handle: RePEc:pra:mprapa:5795
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/5795/2/MPRA_paper_5795.pdf
    File Function: original version
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Rubinstein, Ariel, 1996. "Why Are Certain Properties of Binary Relations Relatively More Common in Natural Language?," Econometrica, Econometric Society, vol. 64(2), pages 343-355, March.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Economics of language; Binary relations; Tournaments;

    JEL classification:

    • C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other
    • Z00 - Other Special Topics - - General - - - General

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:5795. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter) or (Rebekah McClure). General contact details of provider: http://edirc.repec.org/data/vfmunde.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.