{"paper":{"title":"Coalition Resilient Outcomes in Max k-Cut Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gianpiero Monaco, Luciano Gual\\`a, Raffaello Carosi, Simone Fioravanti","submitted_at":"2018-10-22T13:41:34Z","abstract_excerpt":"We investigate strong Nash equilibria in the \\emph{max $k$-cut game}, where we are given an undirected edge-weighted graph together with a set $\\{1,\\ldots, k\\}$ of $k$ colors. Nodes represent players and edges capture their mutual interests. The strategy set of each player $v$ consists of the $k$ colors. When players select a color they induce a $k$-coloring or simply a coloring. Given a coloring, the \\emph{utility} (or \\emph{payoff}) of a player $u$ is the sum of the weights of the edges $\\{u,v\\}$ incident to $u$, such that the color chosen by $u$ is different from the one chosen by $v$. Such"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09278","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}