EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1206. Simple games with minimum
Invited abstract in session MD-36: Game Theory, Solutions and Structures IV, stream Game Theory, Solutions and Structures.
Monday, 14:30-16:00Room: 32 (building: 306)
Authors (first author is the speaker)
| 1. | Sascha Kurz
|
| Mathematics, Physics and Computer Science, University of Bayreuth | |
| 2. | Dani Samaniego
|
| Matemà tiques, Universitat Politècnica de Catalunya |
Abstract
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 results as well as formulas for their dimension.
Keywords
- Game Theory
- Computer Science/Applications
Status: accepted
Back to the list of papers