Universally Balanced Combinatorial Optimization Games
type: Distribution
access URL: https://shs.hal.science/halshs-00670891
format: HTML
issued: 2026-05-28T10:17:39.638055
modified: 2026-05-28T10:17:39.536407

test_moissonnage_selune
type: Agent

Universally Balanced Combinatorial Optimization Games
type: Dataset
contact point: Organization
  fn: CCSD
keyword: core
keyword: integrality
keyword: combinatorial-cooperative-games
keyword: journal-articles
keyword: shsecohumanities-and-social-scienceseconomics-and-finance
keyword: infoeu-reposemanticsarticle
keyword: blocking
keyword: balanced
landing page: 2073-4336
description: This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivisibility. We are interested in the classes of games that guarantee a non-empty core no matter what are the admissible values assigned to the parameters defining these programs. We call such classes universally balanced. We present characterization and complexity results on the universally balancedness property for some classes of interesting combinatorial optimization games. In particular, we focus on the algorithmic properties for identifying universally balancedness for the games under discussion.
issued: 2026-05-28T10:17:39.582314
language: en
modified: 2026-05-28T10:17:39.582322