Abstract
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. I.
| Original language | English |
|---|---|
| Title of host publication | Multidisciplinary Workshop on Advances in Preference Handling - Papers Presented at the 28th AAAI Conference on Artificial Intelligence, Technical Report |
| Pages | 85-89 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781577356714 |
| State | Published - 2014 |
| Event | 28th AAAI Conference on Artificial Intelligence, AAAI 2014 - Quebec City, Canada Duration: Jul 28 2014 → … |
Publication series
| Name | AAAI Workshop - Technical Report |
|---|---|
| Volume | WS-14-10 |
Conference
| Conference | 28th AAAI Conference on Artificial Intelligence, AAAI 2014 |
|---|---|
| Country/Territory | Canada |
| City | Quebec City |
| Period | 7/28/14 → … |
Bibliographical note
Publisher Copyright:© Copyright 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
ASJC Scopus subject areas
- General Engineering