Search arXivSearch

arXiv · 2501.05802

On Scarf's theorem for Generalized Cooperative Games

Abstract

In this paper, we study a generalization of cooperative games with non-transferable utility. In our model, coalitions are replaced by firms: each firm is assigned a resource vector, while the set of utility vectors of a coalition is replaced by a general comprehensive set of feasible payoff vectors of this firm in a common payoff space. We introduce the notions of core and fractional core for such games and relate their existence to homotopy invariants of covers associated with the game. The main result shows that the fractional core is nonempty precisely when the associated cover is homotopicaly nontrivial. As a consequence, we obtain a Scarf-type theorem for generalized cooperative games.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mikhail V. Bludov, Oleg R. Musin. 2026-07-28. On Scarf's theorem for Generalized Cooperative Games. https://arxiv.org/abs/2501.05802

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO