We identify necessary and sufficient conditions under which a coarse data set can be coarsely rationalized by a linear order (or weak order). The conditions are easy to check, and efficient algorithms are provided. We apply our theory to investigate the observable restrictions of several...

Motivated by the literature on random choice and in particular the random utility models, we extend the analysis in Bossert and Sprumont (2013) to include the possibility that players exhibit stochastic preferences over alternatives. We prove that every random choice rule is backwards-induction...

We develop an extension of Luce's random choice model that incorporates a role for the association of alternatives. Each alternative is characterized by a salience value, a Luce value, and its associated alternatives. The salience value captures the alternative's ability to attract the decision...

We examine the impact of party organisation construction of accounting firms on audit quality. We find that although there is no relationship between the party membership status of auditors and audit quality, the audit quality of party-member auditors significantly improves after accounting...

This paper studies a stability notion and matching processes in the job market with incomplete information on the workers' side. Each worker is associated with a type, and each firm cares about the type of her employee under a match. Moreover, firms' information structure is described by...

In this paper, we extend the stability notion and Bayesian efficiency notion of Liu (2020) to local ones, as well as his result—that under certain intuitive conditions, stable matchings are Bayesian efficient—to an analogous one for local notions. Furthermore, the extended stability notion,...

A principal has n homogeneous objects to allocate to I n agents. The principal can allocate at most one good to an agent and each agent values the good. Agents have private information about the principal's payoff of allocating the goods. There are no monetary transfers but the principal can...

We provide a framework for studying two-sided matching markets with incomplete information. The framework accommodates two-sided incomplete information as well as heterogeneous information among the agents. We propose a notion called stability for a market state, which, based upon agents'...

This paper studies a stability notion and matching processes in the job market with incomplete information on the workers' side. Each worker is associated with a type, and each firm cares about the type of her employee under a match. Moreover, firms' information structure is described by...

This paper studies a matching algorithm which is termed incomplete-information deferred acceptance (DA). We show that DA is finite and that it produces a stable market state. We also compare DA with algorithms in the literature, including the complete-information Gale-Shapley algorithm, the...