Simple games with minimum

D. Samaniego Vidal, S. Kurz

Every simple game is a monotone Boolean function. For the other direction we just have to exclude the two constant functions. Here we consider simple games with minimum, i.e., simple games with a unique minimal winning vector. We present enumeration formulas for the number of inequivalent simple games with minimum.

Palabras clave: boolean functions, enumerations, monotonic simple games,

Teoria de Juegos
12 de junio de 2025  19:00
MR 2

M. Chacón Falcón, T. Guy, M. Karny, D. Ríos Insua

A. Bernárdez Ferradás, M. Á. Mirás Calvo, C. Quinteiro Sandomingo, E. Sánchez Rodríguez

L. M. Armijos Toro, J. M. Alonso Meijide, B. V. Casas Méndez, M. A. Mosquera

V. Deibe Blanco, M. J. Campuzano, R. ACOSTA

D. Nieto-Barba, I. Montes, E. Miranda