IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/805| Title: | Lexicographic composition of abstract games |
| Authors: | Lahiri, Somdeb |
| Keywords: | Binary Relations;Abstract Games |
| Issue Date: | 18-Jan-2010 |
| Series/Report no.: | WP;2000-09-01/1617 |
| 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. |
| URI: | http://hdl.handle.net/11718/805 |
| Appears in Collections: | Working Papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| WP 2000_1617.pdf | 408.14 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.