It is known that humans form non-transitive preferences. We propose to model human preferences as a complete weighted directed graph where nodes are objects of preference, and an edge leading from one node to another has weight equal to the probability that the destination node will be preferred (or chosen) from the pair connected by the edge. We also propose that the most preferred object(s) might be modeled as the one that wins in a round-robin tournament played amongst the nodes. We discuss computations using this model and introduce a polynomial-time algorithm to bound the probability of selecting an object from a pool of objects with symmetric preferences.
[1]
Andrew Klapper,et al.
On the complexity of bribery and manipulation in tournaments with uncertain information
,
2012,
J. Appl. Log..
[2]
A. Tversky.
Intransitivity of preferences.
,
1969
.
[3]
Edward L. Braun,et al.
6 – Arithmetic Operations
,
1963
.
[4]
Sarit Kraus,et al.
On the evaluation of election outcomes under uncertainty
,
2008,
Artif. Intell..
[5]
Jörg Rothe,et al.
The complexity of probabilistic lobbying
,
2009,
Discret. Optim..
[6]
J. Dana,et al.
Transitivity of preferences.
,
2011,
Psychological review.
[7]
David N. Freeman.
Access time
,
2003
.