Skip to main content

Decision Support Systems with Multiple Choice Structure

  • Chapter
Numbers, Information and Complexity

Abstract

In the “Triple Brain” approach (“3-Hirn” in German) one human and two computers with different programs are involved. Both programs are started and present one solution each. The human is a controller. He inspects the computer solutions and selects one of them. The human is not allowed to outvote the machines.

“Triple Brain” is a “Decision Support System with Multiple Choice Structure”: Computer programs (one or several) provide a handful of interesting candidate solutions, and a controller (typically a human) has the final choice among these candidates. This article exhibits and discusses various aspects of Decision Support Systems with Multiple Choice Structure.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. I. Althöfer. “Das Dreihirn–Entscheidungsteilung im Schach”, CSS 6/85, December 1985, 20–22.

    Google Scholar 

  2. I. Althöfer, “Selective trees and majority systems: two experiments with commercial chess computers”, Proceedings “Advances in Computer Chess 6 (Editor D. F. Beal ), Ellis Horwood, Chichester, 1991, 37–59.

    Google Scholar 

  3. I. Althöfer, “Een experiment met Dreihirn”, Computerschaak 13.5, October 1993, 186–189.

    Google Scholar 

  4. I. Althöfer, “Doppelfritz mit Chef”, CSS, 596, October 1996, 33–36.

    Google Scholar 

  5. I. Althöfer, “A symbiosis of man and machine beats Grandmaster Timoshchenko”, ICCA-Journal, 20.1, March 1997, 40–47.

    Google Scholar 

  6. I. Althöfer, “Improving computer performance with a touch of human input” (edited by E. Hallsworth) Selective Search, 69, April 1997, 21–25.

    Google Scholar 

  7. I. Althöfer, “List-3-Hirn vs. Grandmaster Yusupov — a report on a very experimental match — Part I: The Games”, ICCA-Journal 21.1, March 1998, 52–60. “- -Part II: Analysis”. ICCA-Journal, 21.2, June 1998, 13 1134.

    Google Scholar 

  8. I. Althöfer, 13 Jahre 3–Hirn — Meine Schach–Experimente mit MenschMaschinen–Kombinationen,Published by the Author, Jena, 1998, ISBN 3–00–003100–6.

    Google Scholar 

  9. I. Althöfer and T. Dettborn, “Der 3-Hirn-Ansatz in der Routenplanung”, Technical Report, University of Jena, Institute of Applied Mathematics, April 1998.

    Google Scholar 

  10. I. Althöfer, C. Donninger, U. Lorenz, and V. Rottmann, “On timing, pemanent brain, and human intervention”. Proceedings “Advances in Computer Chess (Editors H. J. van den Herik, I. S. Herschberg, and J. W. H. M. Uiterwijk ), University of Limburg Press, Maastricht, 1994, 285–296.

    Google Scholar 

  11. I. Althöfer and W. Wenzel. “2-Best solutions under distance constraints: the model and exemplary results for matroids”, 1997, to appear in Advances in Applied Mathematics.

    Google Scholar 

  12. I. Althöfer and W. Wenzel, “k-Best solutions under distance constraints in valuated A—Matroids”. 1998, to appear in Advances in Applied Mathematics.

    Google Scholar 

  13. R. Bellman and R. Kalaba, On the k-th best policies“, Journal of the SIAM 8, 1960, 582–588.

    MathSciNet  Google Scholar 

  14. P. J. Brucker and H. W. Hamacher, “k-optimal solution sets for some polynomially solvable scheduling problems”, European Journal of Operations Research, 41, 1989, 194–202.

    Article  MathSciNet  MATH  Google Scholar 

  15. Y. L. Chow and R. Schwartz, “The N-best algorithm: an efficient search procedure for finding top N sentence hypotheses”. Proceedings “DARPA Speech êi Natural Language Workshop, 1989, 199–202.

    Google Scholar 

  16. A. E. Elo, The Rating of Chess Players, Past and Present, New York, 1978.

    Google Scholar 

  17. D. Eppstein, Internet-Bibliography on k-best algorithms, http://www.ics.uci.edu/eppstein/bibs/kpath.bib

  18. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, Reading, 1989.

    MATH  Google Scholar 

  19. W. Hoffman and R. Pavley, “A method of solution of the Nth best path problem”, Journal of the ACM, 6, 1959, 506–514.

    Article  MathSciNet  MATH  Google Scholar 

  20. H.-J. Kraas, Talk at the University of Jena, December 1997.

    Google Scholar 

  21. M. Luby, A. Sinclair, and D. Zuckerman, “Optimal speedup of Las Vegas algorithms”, Information Processing Letters, 47, 1993, 173–180.

    Article  MathSciNet  MATH  Google Scholar 

  22. C. Lutz, “Report on the Match 3-Hirn vs. Christopher Lutz”, ICCA Journal, 192, 1996, 115–119.

    Google Scholar 

  23. D. McCracken, Man + Computer: a new symbiosis, Communications of the ACM 22, 1979, 587–588.

    Article  Google Scholar 

  24. J. Schoof, “ Kooperative Optimierung mit kommunizierenden Algorithmen”, Dissertation, University of Würzburg, Faculty of Mathematics and Computer Science,September 1998.

    Google Scholar 

  25. A. M. Turing, “Computing machinery and intelligence”, Mind, 59, 1950, 433–460.

    Article  MathSciNet  Google Scholar 

  26. M. Valvo, “Consulting chess with a computer”, ICCA-Journal, 13.2, June 1990, 88–98 and ICCA-Journal, 13.3, September 1990, 156–162.

    Google Scholar 

  27. A. Voss, Personal communication, 1998.

    Google Scholar 

  28. H. Weigel, “Het Elisto-experiment”, Computerschaak,3/85, June 1985, 98–101. (with an introduction by J. Louwman)

    Google Scholar 

  29. H. Weigel, “Best of Four”, MODUL, 188, 1988, 21–23.

    Google Scholar 

  30. E. Weis (editor), Pons Kompaktwörterbuch Englisch-Deutsch, Deutsch-Englisch, Klett, Stuttgart, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Althöfer, I. (2000). Decision Support Systems with Multiple Choice Structure. In: Althöfer, I., et al. Numbers, Information and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6048-4_43

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-6048-4_43

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4967-7

  • Online ISBN: 978-1-4757-6048-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics