A model for intransitive preferences

Sam Saarinen, Craig Tovey, Judy Goldsmith

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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 languageEnglish
Title of host publicationMultidisciplinary Workshop on Advances in Preference Handling - Papers Presented at the 28th AAAI Conference on Artificial Intelligence, Technical Report
Number of pages5
ISBN (Electronic)9781577356714
StatePublished - 2014
Event28th AAAI Conference on Artificial Intelligence, AAAI 2014 - Quebec City, Canada
Duration: Jul 28 2014 → …

Publication series

NameAAAI Workshop - Technical Report


Conference28th AAAI Conference on Artificial Intelligence, AAAI 2014
CityQuebec City
Period7/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


Dive into the research topics of 'A model for intransitive preferences'. Together they form a unique fingerprint.

Cite this