Essential data, budget sets and rationalization
نویسندگان
چکیده
منابع مشابه
Maximum Weighted Independent Sets with a Budget
Given a graph G, a non-negative integer k, and a weight function that maps each vertex in G to a positive real number, the Maximum Weighted Budgeted Independent Set (MWBIS) problem is about finding a maximum weighted independent set in G of cardinality at most k. A special case of MWBIS, when the weight assigned to each vertex is equal to its degree in G, is called the Maximum Independent Verte...
متن کاملAfriat's theorem for general budget sets
Afriat (1967) showed the equivalence of the strong axiom of revealed preference and the existence of a solution to a set of linear inequalities. From this solution he constructed a utility function rationalizing the choices of a competitive consumer. We extend Afriat’s theorem to a class of nonlinear budget sets. We thereby obtain testable implications of rational behavior for a wide class of e...
متن کاملStructural Differencing Estimation with Nonlinear Budget Sets
I develop a reform evaluation method for evaluating labor supply in nonlinear budget sets which is both structural and quasi-experimental. The model only requires preferences to be convex on the budget frontier and results in a simple three-dimensional labor supply function. The estimation exploits only the between-individual variation provided by tax reforms. I apply the method to evaluate ear...
متن کاملEssential sets and support sets for stochastic processes
In recent articles the author used his work in measure and integration to produce a new universal concept of stochastic processes. This concept leads, for the first time, for a stochastic process to a natural notion of essential subsets in the path space. But there remained some contrast to the traditional treatment, for example because for the Poisson process the set of càdlàg paths is not an ...
متن کاملRationalization and Incomplete Information∗
We analyze a family of extensive-form solution procedures for games with incomplete information that do not require the specification of an epistemic type space à la Harsanyi, but can accommodate a (commonly known) collection of explicit restrictions ∆ on first-order beliefs. For any fixed ∆ we obtain a solution called ∆-rationalizability. In static games, ∆-rationalizability characterizes the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economic Theory
سال: 2012
ISSN: 0938-2259,1432-0479
DOI: 10.1007/s00199-012-0716-0