Advanced search
1 file | 435.83 KB

A necessary 4-cycle condition for dice representability of reciprocal relations

Karel De Loof (UGent) , Bernard De Baets (UGent) and Hans De Meyer (UGent)
Author
Organization
Abstract
The comparison of independent random variables can be modeled by a set of dice and a reciprocal relation expressing the winning probability of one dice over another. It is well known that dice transitivity is a necessary 3-cycle condition for a reciprocal relation to be dice representable, i.e. to be the winning probability relation of a set of dice. Although this 3-cycle condition is sufficient for a rational-valued reciprocal relation on a set of three elements to be dice representable, it has been shown that this is no longer the case for sets consisting of four or more elements. In this contribution, we provide a necessary 4-cycle condition for dice representability of reciprocal relations. Moreover, we show that our condition is sufficient in the sense that a given rational-weighted 4-cycle and reciprocally weighted inverse cycle, both fulfilling the 4-cycle condition, can be extended to a winning probability graph representing a dice-representable reciprocal relation on four elements.
Keywords
DECISION-MAKING, CHOICE, CYCLE-TRANSITIVITY, RANDOM-VARIABLES, Winning probability relation, Reciprocal relation, Independent random variables, Dice representability, Dice transitivity

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 435.83 KB

Citation

Please use this url to cite or link to this publication:

Chicago
De Loof, Karel, Bernard De Baets, and Hans De Meyer. 2013. “A Necessary 4-cycle Condition for Dice Representability of Reciprocal Relations.” 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 11 (2): 151–170.
APA
De Loof, K., De Baets, B., & De Meyer, H. (2013). A necessary 4-cycle condition for dice representability of reciprocal relations. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 11(2), 151–170.
Vancouver
1.
De Loof K, De Baets B, De Meyer H. A necessary 4-cycle condition for dice representability of reciprocal relations. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH. 2013;11(2):151–70.
MLA
De Loof, Karel, Bernard De Baets, and Hans De Meyer. “A Necessary 4-cycle Condition for Dice Representability of Reciprocal Relations.” 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 11.2 (2013): 151–170. Print.
@article{4167395,
  abstract     = {The comparison of independent random variables can be modeled by a set of dice and a reciprocal relation expressing the winning probability of one dice over another. It is well known that dice transitivity is a necessary 3-cycle condition for a reciprocal relation to be dice representable, i.e. to be the winning probability relation of a set of dice. Although this 3-cycle condition is sufficient for a rational-valued reciprocal relation on a set of three elements to be dice representable, it has been shown that this is no longer the case for sets consisting of four or more elements. In this contribution, we provide a necessary 4-cycle condition for dice representability of reciprocal relations. Moreover, we show that our condition is sufficient in the sense that a given rational-weighted 4-cycle and reciprocally weighted inverse cycle, both fulfilling the 4-cycle condition, can be extended to a winning probability graph representing a dice-representable reciprocal relation on four elements.},
  author       = {De Loof, Karel and De Baets, Bernard and De Meyer, Hans},
  issn         = {1619-4500},
  journal      = {4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH},
  language     = {eng},
  number       = {2},
  pages        = {151--170},
  title        = {A necessary 4-cycle condition for dice representability of reciprocal relations},
  url          = {http://dx.doi.org/10.1007/s10288-012-0214-z},
  volume       = {11},
  year         = {2013},
}

Altmetric
View in Altmetric
Web of Science
Times cited: