Convex games with an infinite number of players and sequencing situations
From MaRDI portal
Publication:1039463
DOI10.1016/j.jmaa.2009.07.057zbMath1180.91036OpenAlexW2026339897MaRDI QIDQ1039463
Vito Fragnelli, Natividad Llorca, Joaquín Sánchez-Soriano, Rodica Branzei, S. H. Tijs
Publication date: 30 November 2009
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2009.07.057
Related Items (3)
Multiple-machine scheduling with learning effects and cooperative games ⋮ On balanced games with infinitely many players: revisiting Schmeidler's result ⋮ Submodular functions and rooted trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Sequencing games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- A problem of rights arbitration from the Talmud
- A short proof of the inclusion of the core in the Weber set
- Large cores and exactness
- Minimarg and maximarg operators
- The core and related solution concepts for infinite assignment games
- The split core for sequencing games
- Cores of convex games
- Values of games with denumerably many players
- Models in Cooperative Game Theory
- The shapley value for countably many players
This page was built for publication: Convex games with an infinite number of players and sequencing situations