The reviewed record of science sign in
Pith

arxiv: 2501.05169 · v1 · pith:WYFGF3JA · submitted 2025-01-09 · cs.GT

A New Value for Cooperative Games on Intersection-Closed Systems

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:WYFGF3JArecord.jsonopen to challenge →

classification cs.GT
keywords ud-valueintersection-closedsystemsgamesvaluecooperativeic-valueincomplete
0
0 comments X
read the original abstract

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 distributing the total surplus of each family of indistinguishable coalitions uniformly among them. Our primary focus is on set systems that are intersection-closed, for which we show the UD-value is uniquely determined and can be interpreted as the expected Shapley value over all positive (i.e., nonnegative-surplus) extensions of the incomplete game. We compare the UD-value to two existing allocation rules for intersection-closed games: the R-value, defined as the Shapley value of a game that sets surplus of absent coalition values to zero, and the IC-value, tailored specifically for intersection-closed systems. We provide axiomatic characterizations of the UD-value motivated by characterizations of the IC-value and discuss further properties such as fairness and balanced contributions. Further, our experiments suggest that the UD-value and the R-value typically lie closer to each other than either does to the IC-value. Beyond intersection-closed systems, we find that while the UD-value is not always unique, a surprisingly large fraction of non-intersection-closed set systems still yield a unique UD-value, making it a practical choice in broader scenarios of incomplete cooperative games.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.