A Mazur-Orlicz type theorem for submodular set functions

DOI10.1016/0022-247X(86)90175-7zbMath0605.28004MaRDI QIDQ1084205

Jürgen Kindler

Publication date: 1986

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

cooperative game theorysandwich theoremmeasure extensionMazur-Orlicz theoremsubmodular set functiongreedy algorithm for polymatroids

Mathematics Subject Classification ID

Cooperative games (91A12) Real- or complex-valued set functions (28A10) Contents, measures, outer measures, capacities (28A12) Combinatorial aspects of matroids and geometric lattices (05B35) Distributive lattices (06D99)

Related Items

Unnamed Item, On compactness and extreme points of some sets of quasi-measures and measures, On unique extensions of positive additive set functions. II, Ideals of null sets of set functions, Sandwich theorems for set functions, Decompositions of supermodular functions and \(\square\)-decomposable measures, The sigma-core of a cooperative game, Upper envelopes of inner premeasures, A simple proof for the convexity of the Choquet integral, On extreme extensions of quasi-measures, Cumulative prospect theory and imprecise risk, Abstract Riemann integrability and measurability, Modular functions: uniform boundedness and compactness, On the Mazur-Orlicz theorem, The sigma-core of convex games and the problem of measure extension, On the core and Shapley value for regular polynomial games, Cores of games with restricted cooperation, On the continuity of the concave integral, When fuzzy measures are upper envelopes of probability measures, A sandwich theorem for precharges, Extreme points of a set of contents majorized by a submodular set function

Cites Work

• Measures on Boolean algebras
• Finding feasible vectors of Edmonds-Giles polyhedra
• Systems of convex inequalities and their applications
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Binary experiments, minimax tests and 2-alternating capacities
• Convex games and extreme points
• Lattice measures and topologies
• Kapazitäten statt Wahrscheinlichkeiten? Gedanken zur Grundlegung der Statistik
• Two principles for extending probability measures
• Least favorable pairs for special capacities
• On unique extensions of positive additive set functions
• Countably additive measures in cores of games
• Cores of exact games. I
• Minimax tests and the Neyman-Pearson lemma for capacities
• Theory of capacities
• On a theorem of Mazur and Orlicz
• A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
• Submodular systems and related topics
• [https://portal.mardi4nfdi.de/wiki/Publication:3845681 �ber die Fortsetzung von Wahrscheinlichkeitsfeldern]
• Totally Balanced Games and Games of Flow
• Minimizing a Submodular Function on a Lattice
• An Algorithm for Submodular Functions on Graphs
• Filtre moyennant et valeurs moyennes des capacités invariantes
• The Euler Characteristic in Combinatorial Geometry
• Me\fehler und Information
• Interpolation of additive functionals
• Matroids and the greedy algorithm
• Measures in Boolean Algebras
• Multiply Subadditive Functions
• Robust Statistics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item