Preferences with Open Graphs: A New Result

We provide a new characterization of binary relations that have an open graph. This result is applicable to any binary relation on any topological space. The relationship of this new theorem to several known results for binary relations used for preference representation, namely strict partial orders (SPOs), weak orders (WOs), and preorders is described.

MoreLess

Year of publication:	2014-10-24
Authors:	Vohra, Ranjit
Published in:	Economics Bulletin. - AccessEcon, ISSN 1545-2921. - Vol. 34.2014, 4, p. 2267-2274
Publisher:	AccessEcon
Subject:	Binary relations \| Open graph \| Partial order \| Strict partial order \| Continuous binary relations \| Preferences

More details

Extent:	application/pdf
Type of publication:	Article
Classification:	C6 - Mathematical Methods and Programming ; D7 - Analysis of Collective Decision-Making
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011039072