activity
20192026
most citedPositivity and convexity in incomplete cooperative games

3 citations · 4 across the 5 of their papers we have counts for

collaborators

6 papers

cs.LG2026

Active Value Querying to Minimize Additive Error in Subadditive Set Function Learning

Martin Černý, David Sychrovský, Filip Úradník +1

Subadditive set functions play a pivotal role in computational economics (especially in combinatorial auctions), combinatorial optimization or artificial intelligence applications…

cs.GT2026

Maximin Share Guarantees via Limited Cost-Sensitive Sharing

Hana Salavcova, Martin Černý, Arpita Biswas

We study the problem of fairly allocating indivisible goods when limited sharing is allowed, that is, each good may be allocated to up to agents, while incurring a cost for sha…

cs.GT2025

A New Value for Cooperative Games on Intersection-Closed Systems

Martin Černý

We introduce a new allocation rule, the uniform-dividend value (UD-value), for cooperative games whose characteristic function is incomplete. The UD-value assigns payoffs by distri…

cs.GT2024★ 1 cited

Reducing Optimism Bias in Incomplete Cooperative Games

Filip Úradník, David Sychrovský, Jakub Černý +1

Cooperative game theory has diverse applications in contemporary artificial intelligence, including domains like interpretable machine learning, resource allocation, and collaborat…

cs.GT2020★ 3 cited

Positivity and convexity in incomplete cooperative games

Martin Černý, Jan Bok, David Hartman +1

Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the m…

math.CO2019

Interval matrices with Monge property

Martin Černý

We generalize Monge property of real matrices for interval matrices. We define two classes of interval matrices with Monge property - in a strong and in a weak sense. We study fund…