Choice by lexicographic semiorders

Paola Manzini, Marco Mariotti

    Research output: Contribution to journalArticlepeer-review

    Abstract

    In Tversky’s (1969) model of a lexicographic semiorder, a preference is generated
    via the sequential application of numerical criteria by declaring an alternative x
    better than an alternative y if the first criterion that distinguishes between x and
    y ranks x higher than y by an amount exceeding a fixed threshold. We generalize
    this idea to a fully fledged model of boundedly rational choice. We explore the
    connection with sequential rationalizability of choice (Apesteguia and Ballester
    2010, Manzini and Mariotti 2007) and we provide axiomatic characterizations of
    both models in terms of observable choice data.
    Original languageEnglish
    Pages (from-to)1-23
    JournalTheoretical Economics
    Volume7
    Issue number1
    Early online date4 Nov 2010
    DOIs
    Publication statusPublished - Jan 2012

    Keywords

    • Lexicographic semiorders
    • Bounded rationality
    • Revealed preference
    • Choice

    Fingerprint

    Dive into the research topics of 'Choice by lexicographic semiorders'. Together they form a unique fingerprint.

    Cite this