arXiv (All)
open access
Simple games with minimum
Every simple game is a monotone Boolean function. For the other direction we just have to exclude the two constant functions. The enumeration of monotone Boolean functions with distinguishable variables is also known as the Dedekind's problem. The corresponding number for nine variables was determin
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Individual Rationality in Constrained Hedonic Games: Friends, Enemies, and Neutrals#789838
- Category of strategic games and presheaf corresponding to solution concepts or welfare criteria#670740
- Category of strategic games and presheaf corresponding to solution concepts or welfare criteria#668675
- Optimization and Beyond#108435
- QuadraSHAP: $ε$-Exact Shapley Values for Product Games in Logarithmic Parallel Time#1242514
Record · ID 1201854
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive