activity
20102021
most citedBayesian Networks from the Point of View of Chain Graphs

34 citations · 68 across the 12 of their papers we have counts for

collaborators

12 papers

math.CO2021

Facets of the cone of exact games

Milan Studený, Václav Kratochvíl

The class of exact transferable utility coalitional games, introduced in 1972 by Schmeidler, has been studied both in the context of game theory and in the context of imprecise pro…

cs.IT2020★ 1 cited

Conditional independence structures over four discrete random variables revisited: conditional Ingleton inequalities

Milan Studeny

The paper deals with conditional linear information inequalities valid for entropy functions induced by discrete random variables. Specifically, the so-called conditional Ingleton…

math.CO2018★ 3 cited

Facets of the Cone of Totally Balanced Games

Tomáš Kroupa, Milan Studený

The class of totally balanced games is a class of transferable-utility coalitional games providing important models of cooperative behavior used in mathematical economics. They coi…

math.CO2016

Basic facts concerning supermodular functions

Milan Studeny

Elementary facts and observations on the cone of supermodular set functions are recalled. The manuscript deals with such operations with set functions which preserve supermodularit…

math.CO2015★ 1 cited

Polyhedral aspects of score equivalence in Bayesian network structure learning

James Cussens, David Haws, Milan Studeny

This paper deals with faces and facets of the family-variable polytope and the characteristic-imset polytope, which are special polytopes used in integer linear programming approac…

math.CO2014★ 1 cited

Core-based criterion for extreme supermodular functions

M. Studený, T. Kroupa

We give a necessary and sufficient condition for extremality of a supermodular function based on its min-representation by means of (vertices of) the corresponding core polytope. T…