A new class of convex games on \(\sigma\)-algebras and the optimal partitioning of measurable spaces
From MaRDI portal
Publication:637585
DOI10.1007/S00182-010-0258-2zbMath1235.91019OpenAlexW1994265151MaRDI QIDQ637585
Publication date: 6 September 2011
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00182-010-0258-2
Pareto optimalityfair divisioncore stability\(\alpha \)-fairness\(\mu\)-average monotone game\(\mu\)-convex gamenonatomic finite measuretotal balancedness
Related Items (3)
Existence of efficient envy-free allocations of a heterogeneous divisible commodity with nonadditive utilities ⋮ Concave measures and the fuzzy core of exchange economies with heterogeneous divisible commodities ⋮ Submodular functions and rooted trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Measures on Boolean algebras
- A characterization of \(\alpha \)-maximin solutions of fair division problems
- Existence of the core in a heterogeneous divisible commodity exchange economy
- Representation of preference relations on \(\sigma \)-algebras of nonatomic measure spaces: convexity and continuity
- The problem of fair division for countably many participants
- Market games with a continuum of indivisible commodities
- Convex games and extreme points
- Subcalculus for set functions and cores of TU games.
- Countably additive measures in cores of games
- Cores of convex games
- Cores of exact games. I
- How to cut a pizza fairly: fair division with decreasing marginal evaluations
- Relations among certain ranges of vector measures
- Convexity of the lower partition range of a concave vector measure
- How to Cut A Cake Fairly
- Values of Non-Atomic Games
- Fair Division without Additivity
- The Core of an N Person Game
- Average monotonic cooperative games
This page was built for publication: A new class of convex games on \(\sigma\)-algebras and the optimal partitioning of measurable spaces
