English
Related papers

Related papers: On Gale's Contribution in Revealed Preference Theo…

200 papers

To determine the welfare implications of price changes in demand data, we introduce a revealed preference relation over prices. We show that the absence of cycles in this relation characterizes a consumer who trades off the utility of…

Econometrics · Economics 2024-07-03 Rahul Deb , Yuichi Kitamura , John K. -H. Quah , Jörg Stoye

We offer a rationalization of the weak generalized axiom of revealed preference (WGARP) for both finite and infinite data sets of consumer choice. We call it maximin rationalization, in which each pairwise choice is associated with a…

Theoretical Economics · Economics 2019-06-04 Victor H. Aguiar , Per Hjertstrand , Roberto Serrano

The weak axiom of revealed preference (WARP) ensures that the revealed preference (i) is a preference relation (i.e., it is complete and transitive) and (ii) rationalizes the choices. However, when WARP fails, either one of these two…

Theoretical Economics · Economics 2024-01-15 Pablo Schenone

A recent line of work, starting with Beigman and Vohra (2006) and Zadimoghaddam and Roth (2012), has addressed the problem of {\em learning} a utility function from revealed preference data. The goal here is to make use of past data…

Computer Science and Game Theory · Computer Science 2014-07-31 Maria-Florina Balcan , Amit Daniely , Ruta Mehta , Ruth Urner , Vijay V. Vazirani

Afriat's Theorem (1967) states that a dataset can be thought of as being generated by a consumer maximizing a continuous and increasing utility function if and only if it is free of revealed preference cycles containing a strict relation.…

Theoretical Economics · Economics 2024-05-15 Paweł Dziewulski , Joshua Lanier , John K. -H. Quah

This paper studies a general class of social choice problems in which agents' payoff functions (or types) are privately observable random variables, and monetary transfers are not available. We consider cardinal social choice functions…

Theoretical Economics · Economics 2024-08-20 Kazuya Kikuchi , Yukio Koriyama

We prove that a random choice rule satisfies Luce's Choice Axiom if and only if its support is a choice correspondence that satisfies the Weak Axiom of Revealed Preference, thus it consists of alternatives that are optimal according to some…

Theoretical Economics · Economics 2021-05-11 Simone Cerreia-Vioglio , Per Olov Lindberg , Fabio Maccheroni , Massimo Marinacci , Aldo Rustichini

Consider the object allocation (one-sided matching) model of Shapley and Scarf (1974). When final allocations are observed but agents' preferences are unknown, when might the allocation be in the core? This is a one-sided analogue of the…

Theoretical Economics · Economics 2023-08-08 Andrew Tai

This paper develops a framework to study the statistical power of revealed-preference tests. With randomly sampled budgets and mild smoothness of demand, statistical learning implies that any model consistent with the data must approximate…

Theoretical Economics · Economics 2026-02-12 Charles Gauthier , Raghav Malhotra , Agustin Troccoli Moretti

An important -- but very demanding -- property in collective decision-making is strategyproofness, which requires that voters cannot benefit from submitting insincere preferences. Gibbard (1977) has shown that only rather unattractive rules…

Computer Science and Game Theory · Computer Science 2024-12-17 Felix Brandt , Patrick Lederer

Tackling the problem of ordinal preference revelation and reasoning, we propose a novel methodology for generating an ordinal utility function from a set of qualitative preference statements. To the best of our knowledge, our proposal…

Artificial Intelligence · Computer Science 2012-07-09 Carmel Domshlak , Thorsten Joachims

The purpose of this paper is to provide a proof of James' weak compactness theorem that is able to be taught in a first year graduate class in functional analysis.

Functional Analysis · Mathematics 2017-05-19 Warren B. Moors , Samuel White

We give conditions under which the demand function of a strictly convex preference relation can be constructed.

Logic · Mathematics 2016-11-09 Matthew Hendtlass

Bell (1988) introduced the one-switch property for preferences over sequences of dated outcomes. This property concerns the effect of adding a common delay to two such sequences: it says that the preference ranking of the delayed sequences…

Economics · Quantitative Finance 2017-02-09 Nina Anchugina

We study a method for calculating the utility function from a candidate of a demand function that is not differentiable, but is locally Lipschitz. Using this method, we obtain two new necessary and sufficient conditions for a candidate of a…

Theoretical Economics · Economics 2024-04-02 Yuhki Hosoya

Richard Cox [1] set the axiomatic foundations of probable inference and the algebra of propositions. He showed that consistency within these axioms requires certain rules for updating belief. In this paper we use the analogy between…

Artificial Intelligence · Computer Science 2007-05-23 Ali E. Abbas

A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are…

Information Theory · Computer Science 2011-02-17 Hayato Takahashi

Standard decision theory seeks conditions under which a preference relation can be compressed into a single real-valued function. However, when preferences are incomplete or intransitive, a single function fails to capture the agent's…

Theoretical Economics · Economics 2026-02-05 Safal Raman Aryal

This paper exhibits a duality between the theory of Revealed Preference of Afriat and the housing allocation problem of Shapley and Scarf. In particular, it is shown that Afriat's theorem can be interpreted as a second welfare theorem in…

General Economics · Economics 2021-02-05 Ivar Ekeland , Alfred Galichon

Under the assumption of (positive) homogeneity (PH in the sequel) of the corresponding utility functions, we construct polynomial time algorithms for the weak separability, the collective consumption behavior and some related problems.…

Data Structures and Algorithms · Computer Science 2018-01-04 Alexander Shananin , Sergey Tarasov
‹ Prev 1 2 3 10 Next ›