Revealed preference dimension via matrix sign rank
From MaRDI portal
Publication:2190381
Abstract: Given a data-set of consumer behaviour, the Revealed Preference Graph succinctly encodes inferred relative preferences between observed outcomes as a directed graph. Not all graphs can be constructed as revealed preference graphs when the market dimension is fixed. This paper solves the open problem of determining exactly which graphs are attainable as revealed preference graphs in -dimensional markets. This is achieved via an exact characterization which closely ties the feasibility of the graph to the Matrix Sign Rank of its signed adjacency matrix. The paper also shows that when the preference relations form a partially ordered set with order-dimension , the graph is attainable as a revealed preference graph in a -dimensional market.
Recommendations
- The geometry of revealed preference
- Testing consumer rationality using perfect graphs and oriented discs
- Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test
- Revealed preference theory: an algorithmic outlook
- An algebraic approach to revealed preference
Cites work
- A linear lower bound on the unbounded error probabilistic communication complexity.
- General revealed preference theory
- Geometric containment orders: A survey
- Ordered sets
- Partial orders of dimension 2
- Revealed Preference Theory
- Strong activity rules for iterative combinatorial auctions
- Testing consumer rationality using perfect graphs and oriented discs
- The Construction of Utility Functions from Expenditure Data
- The Sign-Rank of AC$^0$
- The combinatorial world (of auctions) according to GARP
- The geometry of revealed preference
This page was built for publication: Revealed preference dimension via matrix sign rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190381)