Skip to main content

Product Triplets in Winning Probability Relations

  • Conference paper
Advances in Computational Intelligence (IPMU 2012)

Abstract

It is known that the winning probability relation of a dice model, which amounts to the pairwise comparison of a set of independent random variables that are uniformly distributed on finite integer multisets, is dice transitive. The condition of dice transitivity, also called the 3-cycle condition, is, however, not sufficient for an arbitrary rational-valued reciprocal relation to be the winning probability relation of a dice model. An additional necessary condition, called the 4-cycle condition, is introduced in this contribution. Moreover, we reveal a remarkable relationship between the 3-cycle condition and the number of so-called product triplets of a reciprocal relation. Finally, we experimentally count product triplets for several families of winning probability relations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David, H.: The Method of Paired Comparisons. Griffin, London (1963)

    Google Scholar 

  2. De Baets, B., De Meyer, H.: Transitivity frameworks for reciprocal relations: cycle-transitivity versus FG-transitivity. Fuzzy Sets and Systems 152, 249–270 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. De Baets, B., De Meyer, H., De Schuymer, B., Jenei, S.: Cyclic evaluation of transitivity of reciprocal relations. Social Choice and Welfare 26, 217–238 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. De Schuymer, B., De Meyer, H., De Baets, B.: Cycle-transitive comparison of independent random variables. Journal of Multivariate Analysis 96, 352–373 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. De Schuymer, B., De Meyer, H., De Baets, B., Jenei, S.: On the cycle-transitivity of the dice model. Theory and Decision 54, 261–285 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fishburn, P.: Binary choice probabilities: on the varieties of stochastic transitivity. Journal of Mathematical Psychology 10, 327–352 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gardner, M.: Mathematical games: The paradox of the nontransitive dice and the elusive principle of indifference. Scientific American 223, 110–114 (1970)

    Google Scholar 

  8. Savage, R.: The paradox of nontransitive dice. The American Mathematical Monthly 101, 429–436 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Switalski, S.: Rationality of fuzzy reciprocal preference relations. Fuzzy Sets and Systems 107, 187–190 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Wrather, C., Lu, P.: Probability dominance in random outcomes. Journal of Optimization Theory and Applications 36, 315–334 (1982)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Loof, K., De Baets, B., De Meyer, H. (2012). Product Triplets in Winning Probability Relations. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds) Advances in Computational Intelligence. IPMU 2012. Communications in Computer and Information Science, vol 300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31724-8_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31724-8_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31723-1

  • Online ISBN: 978-3-642-31724-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics