4 found
Order:
  1.  60
    A Condorcet jury theorem for couples.Ingo Althöfer & Raphael Thiele - 2016 - Theory and Decision 81 (1):1-15.
    The agents of a jury have to decide between a good and a bad option through simple majority voting. In this paper the jury consists of N independent couples. Each couple consists of two correlated agents of the same competence level. Different couples may have different competence levels. In addition, each agent is assumed to be better than completely random guessing. We prove tight lower and upper bounds for the quality of the majority decision. The lower bound is the same (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  6
    A game tree with distinct leaf values which is easy for the alpha-beta algorithm.Ingo Althöfer & Bernhard Balkenhol - 1991 - Artificial Intelligence 52 (2):183-190.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  6
    An incremental negamax algorithm.Ingo Althöfer - 1990 - Artificial Intelligence 43 (1):57-65.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  6
    Data compression using an intelligent generator: The storage of chess games as an example.Ingo Althöfer - 1991 - Artificial Intelligence 52 (1):109-113.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark