A Linear Programming Approach to Estimate the Core in Cooperative Games
Computer Science and Game Theory
2025-10-03 v1 Optimization and Control
Abstract
This paper proposes a novel algorithm to approximate the core of transferable utility (TU) cooperative games via linear programming. Given the computational hardness of determining the full core, our approach provides a tractable approximation by sampling extreme points through randomized linear problems (LPs). We analyze its convergence and computational complexity, and validate its effectiveness through extensive simulations on various game models. Our results show that the method is scalable and achieves high accuracy in terms of core reconstruction.
Keywords
Cite
@article{arxiv.2510.01766,
title = {A Linear Programming Approach to Estimate the Core in Cooperative Games},
author = {J Camacho and JC Gonçalves-Dosantos and J Sánchez-Soriano},
journal= {arXiv preprint arXiv:2510.01766},
year = {2025}
}