Lexicographic composition of abstract games

dc.contributor.author	Lahiri, Somdeb
dc.date.accessioned	2010-01-18T07:55:31Z
dc.date.available	2010-01-18T07:55:31Z
dc.date.copyright	2000-09
dc.date.issued	2010-01-18T07:55:31Z
dc.identifier.uri	http://hdl.handle.net/11718/805
dc.description.abstract	In this paper we begin by obtaining a necessary and sufficient condition for a quasi transitive binary relation to be transitive. Then we obtain necessary and sufficient conditions for the lexicographic composition of two quasi transitive binary relations to be quasi transitive. In passing it is noted that the lexicographic composition of two transitive binary relations is always transitive. Finally, we obtain conditions for the lexicographic composition of two binary relations to be acyclic. It is observed that if the second stage binary relation is acyclic, then the lexicographic composition is acyclic if and only if the first stage binary relation is. All our binary relations are assumed to be reflexive and complete. Such binary relations are called abstract games.	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;2000-09-01/1617
dc.subject	Binary Relations	en
dc.subject	Abstract Games	en
dc.title	Lexicographic composition of abstract games	en
dc.type	Working Paper	en