A Representation of the Maximal Set in Choice Problems Where Information Is Incomplete - Theoretical Economics Letters

TEL > Vol.8 No.11, August 2018

A Representation of the Maximal Set in Choice Problems Where Information Is Incomplete ()

HTML XML

Download as PDF (Size: 332KB) PP. 2631-3639

DOI: 10.4236/tel.2018.811167 759 Downloads 1,951 Views

Author(s)

Andrikopoulos Athanasios

Affiliation(s)

Department of Computer Engineering and Informatics, University of Patras, Patras, Greece.

ABSTRACT

Banerjee and Pattanaik [1] proved that the maximal set generated by a quasi-ordering is equal to the union of the sets of best elements of its ordering extensions. Suzumura and Xu [2] extended Banerjee and Pattanaik’s result by relaxing the axiom of transitivity to the axiom that Suzumura calls consistency. Arló Costa in [3] pointed out that in general, an optimizing model cannot require the transitivity of the binary relation used in an optimizing model. In this paper, by using two important ideas of John Duggan [4], I extend the above mentioned results to arbitrary binary relations whose extensions are complete and not necessarily transitive.

KEYWORDS

Binary Relation, Best Element, Maximalel Ement, Optimal Set, Extension of a Binary Relation

Share and Cite:

Athanasios, A. (2018) A Representation of the Maximal Set in Choice Problems Where Information Is Incomplete. Theoretical Economics Letters, 8, 2631-3639. doi: 10.4236/tel.2018.811167.

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies