Orlovsky solution for acyclic comparison functions

dc.contributor.author	Lahiri, Somdeb
dc.date.accessioned	2009-12-14T04:43:57Z
dc.date.available	2009-12-14T04:43:57Z
dc.date.copyright	2000-05
dc.date.issued	2009-12-14T04:43:57Z
dc.identifier.uri	http://hdl.handle.net/11718/646
dc.description.abstract	n this paper we characterise the Orlovsky solution and what we refer to as the family of threshold solutions. Our family of threshold solutions are somewhat larger than the family of solutions which select only those alternatives that secure a certain prespecified proportion of the votes against all other alternatives. Our family of threshold solutions also include ones which select only those alternatives that exceed a certain prespecified proportion of the votes against all other alternatives. This is the price we pay for ommitting continuity from our axiomatic characterizations	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;2000-05-02/1598
dc.subject	Orlovsky solution	en
dc.subject	Axiomatic characterization	en
dc.title	Orlovsky solution for acyclic comparison functions	en
dc.type	Working Paper	en