Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Schwartz set"'
Publikováno v:
RAIRO - Operations Research. 54:1673-1683
This paper discusses choice procedures that select the set of best alternatives taking into account reflexive binary relations (called pseudo-tournaments in the paper), such as those that can be obtained when constructing an outranking relation à la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acb5c306e70b9c8853f1c22baf560613
https://doi.org/10.1051/ro/2019110
https://doi.org/10.1051/ro/2019110
Autor:
Athanasios Andrikopoulos
Publikováno v:
Decisions in Economics and Finance. 39:333-336
Schwartz in (Nous,7, 1972, Definition, 3) introduces a generalization of the Condorcet criterion, which is the classical approach to rational choice in the context of cycles, and he defines the Schwartz set. Deb (J Econ Theory 16:103–110, 1977) sho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6733c07d8f6f5bd50ed7584e678eab78
https://doi.org/10.1007/s10203-016-0180-6
https://doi.org/10.1007/s10203-016-0180-6
Publikováno v:
Topology and its Applications. 159:1987-1992
The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories. In this paper, we characterize the existence of the most important solution theories of arbitrary binary relatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89cd23386eecdc7e8f4657e16309c91a
https://doi.org/10.1016/j.topol.2011.04.030
https://doi.org/10.1016/j.topol.2011.04.030
Autor:
Athanasios Andrikopoulos
Publikováno v:
Economic Theory Bulletin. 1:105-110
Compactness is an important topological property as it enables us to apply minimax theorems in economic theory. The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8245cf8b3aba9046fe8f3460dc796328
https://doi.org/10.1007/s40505-013-0002-8
https://doi.org/10.1007/s40505-013-0002-8
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2013, 226 (3), pp.636-645. ⟨10.1016/j.ejor.2012.11.025⟩
European Journal of Operational Research, 3(226), 636-645. Elsevier
European Journal of Operational Research, Elsevier, 2013, 226 (3), pp.636-645. ⟨10.1016/j.ejor.2012.11.025⟩
European Journal of Operational Research, 3(226), 636-645. Elsevier
International audience; We describe a simple computing technique for the tournament choice problem. It rests upon relational modeling and uses the BDD-based computer system RelView for the evaluation of the relation-algebraic expressions that specify
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8724e092397d9cae261630d8777a1c8d
https://pure.eur.nl/en/publications/2331b200-e257-4b40-8aad-e96838b687b2
https://pure.eur.nl/en/publications/2331b200-e257-4b40-8aad-e96838b687b2
Publikováno v:
Mathematical Logic Quarterly. 55:444-459
Social choice rules are often evaluated and compared by inquiring whether they satisfy certain desirable criteria such as the Condorcet criterion, which states that an alternative should always be chosen when more than half of the voters prefer it ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a253d2e122a36580c3a762e11528efa8
https://doi.org/10.1002/malq.200810027
https://doi.org/10.1002/malq.200810027
We describe a simple computing technique for the tournament choice problem. It rests upon a relational modeling and uses the BDD-based computer system RelView for the evaluation of the relation-algebraic expressions that specify the solutions and for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a02f536e64b18dfa44ff86398e1159c3
https://halshs.archives-ouvertes.fr/halshs-00639942/document
https://halshs.archives-ouvertes.fr/halshs-00639942/document
Autor:
Athanasios Andrikopoulos
In this article, we analyze the problem of choice based on potentially ill-behaved binary relations that may fail to possess maximal elements. The approach, which is based on Duggan (Soc Choice Welf 28:491-506, 2007), is to consider every maximal sub
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc7c24947765b1acaa8196108ca15633
http://olympias.lib.uoi.gr/jspui/handle/123456789/11378
http://olympias.lib.uoi.gr/jspui/handle/123456789/11378
Autor:
Andrikopoulos, Athanasios
In this paper, I give a characterization of the Generalized Top-Choice Assumption set of a binary relation in terms of choice from minimal negative consistent superrelations. This result provides a characterization of Schwart's set in tournaments.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______645::518dba07ffe8b2536b599df08a25da9f
https://mpra.ub.uni-muenchen.de/14897/1/MPRA_paper_14897.pdf
https://mpra.ub.uni-muenchen.de/14897/1/MPRA_paper_14897.pdf
Autor:
Felix Brandt, Felix Fischer
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540771043
WINE
WINE
We observe that ranking systems--a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz--and tournament solutions--a well-studied area of social choice theory--are strongly related. This relation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7637412b251572e32d26c58f7cad4a41
https://doi.org/10.1007/978-3-540-77105-0_30
https://doi.org/10.1007/978-3-540-77105-0_30