Core-based criterion for extreme supermodular functions

DOI10.1016/J.DAM.2016.01.019zbMath1342.90193arXiv1410.8395OpenAlexW1434250081MaRDI QIDQ277638

Tomáš Kroupa, Milan Studený

Publication date: 2 May 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.8395

zbMATH Keywords

submodular functioncoreconditional independencegeneralized permutohedronindecomposable polytopesupermodular function

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (10)

Facets of the cone of exact games ⋮ Polyhedral aspects of score equivalence in Bayesian network structure learning ⋮ Remarkable polyhedra related to set functions, games and capacities ⋮ The intermediate set and limiting superdifferential for coalitional games: between the core and the Weber set ⋮ Generalized permutahedra: Minkowski linear functionals and Ehrhart positivity ⋮ Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022 ⋮ Polyhedral approaches to learning Bayesian networks ⋮ Linear criterion for testing the extremity of an exact game based on its finest min-representation ⋮ The cone of supermodular games on finite distributive lattices ⋮ Coxeter submodular functions and deformations of Coxeter permutahedra

Uses Software

• Convex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the Shapley-ichiishi result
• On open questions in the geometric approach to structural learning Bayesian nets
• Extreme lower previsions
• Extreme lower probabilities
• Faces of generalized permutohedra
• The expressive power of binary submodular functions
• Matroid polytopes and their volumes
• Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Submodular functions and optimization
• Extreme convex set functions with finite carrier: General theory
• Cores of cooperative games, superdifferentials of functions, and the Minkowski difference of sets
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Characterizing convexity of games using marginal vectors
• Extremality of submodular functions
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• Supermodular functions on finite lattices
• Cores of convex games
• Cores of exact games. I
• A class of extreme convex set functions with finite carrier
• Cones of Elementary Imsets and Supermodular Functions: A Review and Some New Results
• Permutohedra, Associahedra, and Beyond
• Semimodular Functions and Combinatorial Geometries
• Convex Polytopes
• Indecomposable Polytopes

This page was built for publication: Core-based criterion for extreme supermodular functions