arXiv (All)
open access
Balanced 2-subsets
Balanced sets appeared in the 1960s in cooperative game theory as a part of nonempty core conditions. In this paper we present a classification of balanced families containing only 2-element subsets. We also discuss generalizations of the classical Sperner and Tucker lemmas using balanced sets.
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
- A century of theories of balancing selection#433566
- Coalition strategy-proof anonymous binary social choice in a countably infinite society#1011551
- Introduction: Formal approaches to multi-agent systems: Special issue of best papers of FAMAS 2007#721460
- Mécanismes de formation de coalitions multi-agents avec externalités#330307
- False-name-proof and strategy-proof voting rules under separable preferences#1053541
Record · ID 799806
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