English
Related papers

Related papers: It's complicated: A Non-parametric Test of Prefere…

200 papers

We all have preferences when multiple choices are available. If we insist on satisfying our preferences only, we may suffer a loss due to conflicts with other people's identical selections. Such a case applies when the choice cannot be…

Theoretical Economics · Economics 2023-02-21 Hiroaki Shinkawa , Nicolas Chauvet , Guillaume Bachelier , André Röhm , Ryoichi Horisaki , Makoto Naruse

Given only aggregate choice data and limited information about how menus are distributed across the population, we describe what can be inferred robustly about the distribution of preferences (or more general decision rules). We strengthen…

Theoretical Economics · Economics 2024-05-16 Larry G Epstein , Kaushil Patel

Many-to-many matching with contracts is studied in the framework of revealed preferences. All preferences are described by choice functions that satisfy natural conditions. Under a no-externality assumption individual preferences can be…

Computer Science and Game Theory · Computer Science 2020-03-05 Daniel Lehmann

We study a dynamic random utility model that allows for consumption dependence. We axiomatically analyze this model and find insights that allow us to distinguish between behavior that arises due to consumption dependence and behavior that…

Theoretical Economics · Economics 2025-02-20 Christopher Turansick

We provide a generalized revealed preference test for quasilinear preferences. The test applies to nonlinear budget sets and non-convex preferences as those found in taxation and nonlinear pricing contexts. We study the prevalence of…

General Economics · Economics 2025-03-19 Mikhail Freer , Marco Castillo

We study popularity for matchings under preferences. This solution concept captures matchings that do not lose against any other matching in a majority vote by the agents. A popular matching is said to be robust if it is popular among…

Data Structures and Algorithms · Computer Science 2025-10-23 Martin Bullinger , Gergely Csáji , Rohith Reddy Gangam , Parnian Shahkar

We study the Popular Matching problem in multiple models, where the preferences of the agents in the instance may change or may be unknown/uncertain. In particular, we study an Uncertainty model, where each agent has a possible set of…

Computer Science and Game Theory · Computer Science 2025-06-06 Gergely Csáji

In panel data we observe a usually high number N of individuals over a time period T. Even if T is large one often assumes stability of the model over time. We propose a nonparametric and robust test for a change in location and derive its…

Statistics Theory · Mathematics 2017-03-22 Alexander Dürre , Roland Fried

We use novel nonparametric techniques to test for the presence of non-classical measurement error in reported life satisfaction (LS) and study the potential effects from ignoring it. Our dataset comes from Wave 3 of the UK Understanding…

Econometrics · Economics 2019-05-16 Ekaterina Oparina , Sorawoot Srisuma

We consider a learning problem for the stable marriage model under unknown preferences for the left side of the market. We focus on the centralized case, where at each time step, an online platform matches the agents, and obtains a noisy…

Machine Learning · Computer Science 2025-01-07 Andreas Athanasopoulos , Anne-Marie George , Christos Dimitrakakis

In this paper, I develop a refinement of stability for matching markets with incomplete information. I introduce Information-Credible Pairwise Stability (ICPS), a solution concept in which deviating pairs can use credible, costly tests to…

Theoretical Economics · Economics 2025-10-28 Kaibalyapati Mishra

A model of two consumer-resource systems linked by interspecific interference competition of consumers is considered. The basic assumption of the model is that the dynamics of the resource is much slower than that of the consumer. In the…

Populations and Evolution · Quantitative Biology 2015-06-16 A. Mustafin

We introduce the problem of adapting a stable matching to forced and forbidden pairs. Specifically, given a stable matching $M_1$, a set $Q$ of forced pairs, and a set $P$ of forbidden pairs, we want to find a stable matching that includes…

Computer Science and Game Theory · Computer Science 2022-11-23 Niclas Boehmer , Klaus Heeger

We study how to perform tests on samples of pairs of observations and predictions in order to assess whether or not the predictions are prudent. Prudence requires that that the mean of the difference of the observation-prediction pairs can…

Risk Management · Quantitative Finance 2022-10-03 Dirk Tasche

The Random Utility Model (RUM) is the gold standard in describing the behavior of a population of consumers. The RUM operates under the assumption of transitivity in consumers' preference relationships, but the empirical literature has…

Theoretical Economics · Economics 2024-06-21 Wilfried Youmbi

In this article, we propose a new method for the fundamental task of testing for dependence between two groups of variables. The response densities under the null hypothesis of independence and the alternative hypothesis of dependence are…

Methodology · Statistics 2015-01-29 Yimin Kao , Brian J Reich , Howard D Bondell

A statistical hypothesis test determines whether a hypothesis should be rejected based on samples from populations. In particular, randomized controlled experiments (or A/B testing) that compare population means using, e.g., t-tests, have…

Cryptography and Security · Computer Science 2018-03-28 Bolin Ding , Harsha Nori , Paul Li , Joshua Allen

The Balanced Stable Marriage problem is a central optimization version of the classic Stable Marriage problem. Here, the output cannot be an arbitrary stable matching, but one that balances between the dissatisfaction of the two parties,…

Data Structures and Algorithms · Computer Science 2017-08-01 Sushmita Gupta , Sanjukta Roy , Saket Saurabh , Meirav Zehavi

We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley[GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…

Discrete Mathematics · Computer Science 2025-12-23 Rohith Reddy Gangam , Tung Mai , Nitya Raju , Vijay V. Vazirani

Many countries around the world, including Korea, use the school choice lottery system. However, this method has a problem in that many students are assigned to less-preferred schools based on the lottery results. In addition, the task of…

Discrete Mathematics · Computer Science 2024-01-12 Seongbeom Park