arXiv (All)
open access
String-averaging bargaining in solidarity cooperative games
We consider the situation that the grand set of all players, in a cooperative game in characteristic function form with a nonempty core, consists of recognizable subsets of players. The underlying assumption is that the players of each subset have something in common between themselves which is not
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
- Game Theory#702308
- Strategy-proof judgment aggregation#748775
- Disjoint unions and fixed-parameter algorithms for chromatic villainy#1297908
- Maker-Breaker Largest Connected Subgraph Game in Trees#1090704
- Induced Representations in Cooperative Games with Homogeneous Groups of Players#1105028
Record · ID 1534251
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