On Dedekind’s problem for complete simple games

We state an integer linear programming formulation for the unique characterization of complete simple games, i.e. a special subclass of monotone Boolean functions. In order to apply the parametric Barvinok algorithm to obtain enumeration formulas for these discrete objects we provide a tailored deco...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of game theory Vol. 42; no. 2; pp. 411 - 437
Main Authors:	Kurz, Sascha, Tautenhahn, Nikolas
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer-Verlag 01.05.2013 Springer [[2009-]] Springer Nature B.V
Subjects:	Algorithms Behavioral/Experimental Economics Boolean Codes Economic Theory/Quantitative Economics/Mathematical Methods Economics Economics and Finance Enumeration Game Theory Games Integer programming Linear programming Operations Research/Decision Theory Social and Behav. Sciences Studies Voters Voting theory 91B12 52B20 Boolean functions Dedekind’s problem Complete simple games Application of the parametric Barvinok algorithm 94C10 05A15
ISSN:	0020-7276, 1432-1270
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!