Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computers and Games

CG 2016: Computers and Games pp 202–211Cite as

An Analysis of Majority Systems with Dependent Agents in a Simple Subtraction Game

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10068))

Abstract

It is common knowledge that a majority system is typically better than its components, when the components are stochastically independent. However, in practice the independency assumption is often not justified. We investigate systems of experts which are constituted by couples of dependent agents. Based on recent theoretical work we analyse their performance in a simple 2-player subtraction game. It turns out that systems with negatively correlated couples perform better than those with positive correlation within the couples. From computer chess practice it was at least known that systems of very positively correlated bots were not too successful.

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

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Althöfer, I.: Selective trees and majority systems: two experiments with commercial chess computers. In: Beal, D.F. (ed.) Advances in Computer Chess, vol. 6, pp. 37–59. Ellis Horwood, Chichester (1991)

    Google Scholar 

  2. Althöfer, I., Thiele, R.: A condorcet jury theorem for couples. Theor. Decis. 81, 1–15 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bahadur, R.R.: A Representation of the joint distribution of responses to n dichotomous items. In: Solomon, H. (ed.) Studies in Item Analysis and Prediction, pp. 158–168. Stanford University Press, California (1961)

    Google Scholar 

  4. Ben-Yashar, R., Paroush, J.: A nonasymptotic Condorcet jury theorem. Soc. Choice Welfare 17(2), 189–199 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Boland, P.J., Proschan, F., Tong, Y.L.: Modelling dependence in simple and indirect majority systems. J. Appl. Probab. 26(1), 81–88 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fischer, T.: Exakte analyse von Heuristiken für kombinatorische Spiele. Doctoral dissertation, Friedrich Schiller University Jena (2011). http://www.althofer.de/dissertation_thomas-fischer.pdf

  7. Grofman, B.: A comment on ‘democratic theory: a preliminary mathematical model’. Public Choice 21(1), 99–103 (1975)

    Article  MathSciNet  Google Scholar 

  8. Jiang, A., Soriano Marcolino, L., Procaccia, A.D., Sandholm, T., Shah, N., Tambe, M.: Diverse randomized agents vote to win. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K. (eds.) Advances in Neural Information Processing Systems, vol. 27, pp. 2573–2581. Curran Associates, Inc. (2014)

    Google Scholar 

  9. Kaniovski, S.: Aggregation of correlated votes and Condorcet’s Jury theorem. Theor. Decis. 69(3), 453–468 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lam, L., Suen, S.Y.: Application of majority voting to pattern recognition: an analysis of its behavior and performance. Trans. Sys. Man Cyber. Part A 27(5), 553–568 (1997)

    Article  Google Scholar 

  11. Manabe, K., Muramatsu, M.: Boosting Approach for Consultaton by Weighted Majority Vote in Computer Go. IPSJ Symposium Series 2011, vol. 6, pp. 128–134 (2011)

    Google Scholar 

  12. Obata, T., Sugiyama, T., Hoki, K., Ito, T.: Consultation algorithm for computer shogi: move decisions by majority. In: Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 156–165. Springer, Heidelberg (2011). doi:10.1007/978-3-642-17928-0_15

    Chapter  Google Scholar 

  13. Owen, G., Grofman, B., Feld, S.L.: Proving a distribution-free generalization of the Condorcet Jury theorem. Math. Soc. Sci. 17(1), 1–16 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sato, Y., Cincotti, A., Iida, H.: An analysis of voting algorithm in games. In: Computer Games Workshop at ECAI 2012, pp. 102–113 (2012)

    Google Scholar 

  15. Zaigraev, A., Kaniovski, S.: A note on the probability of at least k successes in n correlated binary trials. Oper. Res. Lett. 41(1), 116–120 (2013)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

We want to thank three anonymous referees for there constructive reports.

Author information

Authors and Affiliations

  1. Friedrich-Schiller-Universität, Fakultät Für Mathematik Und Informatik, 07743, Jena, Germany

    Raphael Thiele & Ingo Althöfer

Authors
  1. Raphael Thiele
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ingo Althöfer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raphael Thiele .

Editor information

Editors and Affiliations

  1. Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, Zuid-Holland, The Netherlands

    Aske Plaat

  2. Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, Zuid-Holland, The Netherlands

    Walter Kosters

  3. Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, Zuid-Holland, The Netherlands

    Jaap van den Herik

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Thiele, R., Althöfer, I. (2016). An Analysis of Majority Systems with Dependent Agents in a Simple Subtraction Game. In: Plaat, A., Kosters, W., van den Herik, J. (eds) Computers and Games. CG 2016. Lecture Notes in Computer Science(), vol 10068. Springer, Cham. https://doi.org/10.1007/978-3-319-50935-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50935-8_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50934-1

  • Online ISBN: 978-3-319-50935-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation