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.

Keywords: boolean functions, enumerations, monotonic simple games,

Scheduled

Game Theory
June 12, 2025  7:00 PM
Mr 2

Other papers in the same session

Adversarial risk analysis with fully probabilistic designs

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

Airport problems with cloned agents.

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

Coalition Formation in Agricultural Supply Chains: A Cooperative Game Theory Approach

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

Robustificación de medidas no aditivas mediante la variación total

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

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.