Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3580507.3597792acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
extended-abstract

Axiomatization of Random Utility Model with Unobservable Alternatives

Published: 07 July 2023 Publication History

Abstract

The random utility model is one of the most fundamental models in discrete choice analysis in economics. Although Falmagne (1978) obtained an axiomatization of the random utility model, his characterization requires strong observability of choices, i.e., the frequencies of choices must be observed from all subsets of the set of alternatives. Little is known, however, about the axiomatization when the frequencies on some choice sets are not observable. In fact, the problem of obtaining a tight characterization appears to be out of reach in most cases in view of a related NP-hard problem. We consider the following incomplete dataset. Let X be a finite set of alternatives. Let X*X bea set of unobservable alternatives. Let D ⊆ 2X be the set of choice sets. We assume that the choice frequency ρ(D, x) is unobservable (i.e., not defined) if and only if x ∈ X* or DD. Let M* ≡ {(D,x)|x ∈ D ∈ 2X and [xX* or DD]} be the set of all pairs (D,x) such that ρ(D, x) is not observable. To state our theorem, for any ρ and (D, x) ∈ M ≡ {(D, x) ∈ D × X | xD}, define a Block-Marschak polynomial by K(ρ, D, x) = ΣE:E⊇D(−1)|E\D|ρ(E,x).

Index Terms

  1. Axiomatization of Random Utility Model with Unobservable Alternatives
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        EC '23: Proceedings of the 24th ACM Conference on Economics and Computation
        July 2023
        1253 pages
        ISBN:9798400701047
        DOI:10.1145/3580507
        Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 07 July 2023

        Check for updates

        Qualifiers

        • Extended-abstract

        Conference

        EC '23
        Sponsor:
        EC '23: 24th ACM Conference on Economics and Computation
        July 9 - 12, 2023
        London, United Kingdom

        Acceptance Rates

        Overall Acceptance Rate 664 of 2,389 submissions, 28%

        Upcoming Conference

        EC '25
        The 25th ACM Conference on Economics and Computation
        July 7 - 11, 2025
        Stanford , CA , USA

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • 0
          Total Citations
        • 20
          Total Downloads
        • Downloads (Last 12 months)8
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 27 Jan 2025

        Other Metrics

        Citations

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media