Article ID: | iaor19961725 |
Country: | Germany |
Volume: | 42 |
Issue: | 2 |
Start Page Number: | 189 |
End Page Number: | 216 |
Publication Date: | Sep 1995 |
Journal: | Mathematical Methods of Operations Research (Heidelberg) |
Authors: | Krohn I., Sudhlter P. |
In this paper the authors deal with several classes of simple games; the first class is the one of ordered simple games (i.e. they admit of a complete desirability relation). The second class consists of all zero-sum games in the first one. First of all the authors introduce a ‘natural’ partial order on both classes respectively and prove that this order relation admits a rank function. Also the first class turns out to be a rank symmetric lattice. These order relations induce fast algorithms to generate both classes of ordered games. Next the authors focus on the class of weighted majority games with