The Max k-Cut Game: On Stable Optimal Colorings

06/09/2020
by   Chiara Mocenni, et al.
0

We study the max k-cut game on an undirected and unweighted graph in order to find out whether an optimal solution is also a strong equilibrium. While we do fail to show that, by proving an alternate formula for computing the cut value difference for a strong deviation, we show that optimal solutions are 7-stable equilibria. Furthermore, we prove some properties of minimal subsets with respect to a strong deviation, showing that each of their nodes will deviate towards the color of one of their neighbors and that those subsets induce connected subgraphs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 19

10/22/2018

Coalition Resilient Outcomes in Max k-Cut Games

We investigate strong Nash equilibria in the max k-cut game, where we ar...
03/29/2019

Connected max cut is polynomial for graphs without K_5 e as a minor

Given a graph G=(V, E), a connected cut δ (U) is the set of edges of E l...
03/15/2018

Approximating Max-Cut under Graph-MSO Constraints

We consider the max-cut and max-k-cut problems under graph-based constra...
06/25/2018

Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium

Several works have shown unconditional hardness (via integrality gaps) o...
07/16/2018

Improving the smoothed complexity of FLIP for max cut problems

Finding locally optimal solutions for max-cut and max-k-cut are well-kno...
05/06/2021

How to split the costs among travellers sharing a ride? Aligning system's optimum with users' equilibrium

How to form groups in a mobility system that offers shared rides, and ho...
01/09/2022

Inverse optimization problems with multiple weight functions

We introduce a new class of inverse optimization problems in which an in...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.