Abstract
We introduce μ-convexity, a new kind of game convexity defined on a σ-algebra of a nonatomic finite measure space. We show that μ-convex games are μ-average monotone. Moreover, we show that μ-average monotone games are totally balanced and their core contains a nonatomic finite signed measure. We apply the results to the problem of partitioning a measurable space among a finite number of individuals. For this problem, we extend some results known for the case of individuals’ preferences that are representable by nonatomic probability measures to the more general case of nonadditive representations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aumann RJ, Shapley LS (1974) Values of non-atomic games. Princeton University Press, Princeton
Bondareva ON (1963) Some applications of linear programming methods to the theory of cooperative games. Problemy Kibernitiki 10: 119–139 (in Russian)
Dall’Aglio M, Maccheroni F (2005) Fair division without additivity. Am Math Mon 112: 363–365
Delbaen F (1974) Convex games and extreme points. J Math Anal Appl 45: 210–233
Dubins LE, Spanier EH (1961) How to cut a cake fairly. Am Math Mon 68: 1–17
Dunford N, Schwartz JT (1958) Linear operators, Part I: General theory. Wiley, New York
Dvoretsky A, Wald A, Wolfowitz J (1951) Relations among certain ranges of vector measures. Pac J Math 1: 59–74
Halmos PR (1950) Measure theory. Van Nostrand, New York
Hüsseinov F (2008) Existence of the core in a heterogeneous divisible commodity exchange economy. Int J Game Theory 37: 387–395
Izqueirdo JM, Rafels C (2001) Average monotonic cooperative games. Games Econ Behav 36: 174–192
Kannai Y (1969) Countably additive measures in cores of games. J Math Anal Appl 27: 227–240
Kannai Y (1992) The core and balancedness. In: Aumann RJ, Hart S (eds) Handbook of game theory with economic applications, vol 1. Elsevier, Amsterdam, pp 355–395
Kelley JL (1959) Measures on Boolean algebras. Pac J Math 9: 1165–1177
Legut J (1985) The problem of fair division for countably many participants. J Math Anal Appl 109: 83–89
Legut J (1986) Market games with a continuum of indivisible commodities. Int J Game Theory 15: 1–7
Maccheroni F, Marinacci M (2003) How to cut a pizza fairly: fair division with decreasing marginal evaluations. Soc Choice Welf 20: 457–465
Marinacci M, Montrucchio L (2003) Subcalculus for set functions and cores of TU games. J Math Econ 39: 1–25
Marinacci M, Montrucchio L (2004) Introduction to the mathematics of ambiguity. In: Gilboa I (ed) Uncertainty in economic theory. Routledge, New York, pp 46–107
Sagara N (2006) An existence result on partitioning of a measurable space: Pareto optimality and core. Kybernetika 42: 475–481
Sagara N (2008) A characterization of α-maximin solutions of fair division problems. Math Soc Sci 55: 273–280
Sagara N (2010) Fair division problems with nonadditive evaluations: existence of solutions and representation of preference orderings. In: Varela J, Acuña S (eds) Handbook of optimization theory: decision analysis and application. Nova Science Publishers, Hauppauge (forthcoming)
Sagara N, Vlach M (2009) Representation of preference relations on σ-algebras of nonatomic measure spaces: convexity and continuity. Fuzzy Sets Syst 160: 624–634
Sagara N, Vlach M (2010a) Convex functions on σ-algebras of nonatomic measure spaces. Pac J Optim 6: 89–102
Sagara N, Vlach M (2010b) Convexity of the lower partition range of a concave vector measure. Adv Math Econ 6: 155–160
Scarf HE (1967) The core of an N person game. Econometrica 35: 50–69
Schmeidler D (1972) Cores of exact games, I. J Math Anal Appl 40: 214–225
Shapley LS (1967) On balanced sets and cores. Naval Res Logist 14: 453–460
Shapley LS (1971) Cores of convex games. Int J Game Theory 1: 11–26
Shapley LS, Shubik M (1969) On market games. J Econ Theory 1: 9–25
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sagara, N., Vlach, M. A new class of convex games on σ-algebras and the optimal partitioning of measurable spaces. Int J Game Theory 40, 617–630 (2011). https://doi.org/10.1007/s00182-010-0258-2
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00182-010-0258-2