Loading...
Loading...

Go to the content (press return)

Efficient enumeration of complete simple games

Author
Molinero, X.; Polyméris, A.; Riquelme, F.; Serna, M.
Type of activity
Presentation of work at congresses
Name of edition
Fifth International Conference on Game Theory and Management
Date of publication
2011
Presentation's date
2011-06-27
Book of congress proceedings
Game Theory and Management: The Fifth International Conference
First page
165
Last page
166
URL
https://dspace.spbu.ru/bitstream/11701/1446/1/GTM%20Abstracts%202011.pdf Open in new window
Abstract
This algorithm does not use linear programming, being its computational complexity analysis easier than the ones which use it. Moreover, the enumeration is made (pre-)ordering the complete games in a lattice structure, which may be interesting for the verification of other properties; for instance, the level of a game inside the lattice, its distance to the greatest and least element, or the distance between two different games. Finally, we also compare this algorithm with the used in [FM08], fr...
Keywords
complete simple game, distributive lattice, pre-ordering
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods
GRTJ - Game Theory Research Group

Participants