A Hybrid Stochastic-Full Enumeration Approach to a Ranking Problem with Insufficient Information
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19520%2F24%3AA0000444" target="_blank" >RIV/47813059:19520/24:A0000444 - isvavai.cz</a>
Result on the web
<a href="https://ieeexplore.ieee.org/document/10480171" target="_blank" >https://ieeexplore.ieee.org/document/10480171</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/CISS59072.2024.10480171" target="_blank" >10.1109/CISS59072.2024.10480171</a>
Alternative languages
Result language
angličtina
Original language name
A Hybrid Stochastic-Full Enumeration Approach to a Ranking Problem with Insufficient Information
Original language description
When comparing n objects pairwise, at least (n−1) comparisons have to be performed (assuming that a corresponding directed graph is connected) for a derivation of a ranking (a total or partial order) of all objects. The aim of the paper is to introduce a novel algorithm for a case with insufficient information, that is the case when the number of available pairwise comparisons ranges from 1 to (n − 2). It is assumed that the comparisons are performed via the following two non-numerical binary relations: preference relation (≻) and indifference relation(∼). The algorithm provides a probability of each possible ranking (permutation) of all compared objects based on the revealed pairwise comparisons, while missing comparisons are modeled via full enumeration of all feasible cases (for a small number of objects), or via Monte Carlo simulations (for a large number of objects).
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA21-03085S" target="_blank" >GA21-03085S: Supporting Decision Processes with Pairwise Comparisons and Data Mining</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
2024 58th Annual Conference on Information Sciences and Systems (CISS)
ISBN
—
ISSN
2837-178X
e-ISSN
—
Number of pages
6
Pages from-to
1-6
Publisher name
IEEE Xplore
Place of publication
USA
Event location
Princeton University
Event date
Mar 13, 2024
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—