Revealed preference dimension via matrix sign rank

From MaRDI portal
Publication:2190381

DOI10.1007/978-3-030-04612-5_5zbMATH Open1443.91121arXiv1807.10878OpenAlexW2883586956MaRDI QIDQ2190381FDOQ2190381


Authors: Shant Boodaghians Error creating thumbnail:


Publication date: 18 June 2020

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 d-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 k, the graph is attainable as a revealed preference graph in a k-dimensional market.


Full work available at URL: https://arxiv.org/abs/1807.10878




Recommendations




Cites Work


Cited In (1)





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)