3 papers
math.OC2026
Social Optimality Does Not Imply Coalitional Stability in Unweighted Max-k-Cut Games
Hritiz Gogoi
In Max--Cut games, optimal colorings maximize social welfare, but are they stable against coordinated deviations that strictly benefit every participating player? A recurring co…
math.OC2026
Max--Cut via Node Features
Avinash Bhardwaj, Hritiz Gogoi, Vishnu Narayanan
We study the Max--Cut problem from a node-feature perspective, where each vertex is associated with a feature vector and edge weights are given by pairwise inner products. We fi…
math.OC2025
On exactness of SDP relaxation for the maximum cut problem
Avinash Bhardwaj, Hritiz Gogoi, Vishnu Narayanan +1
Semidefinite programming (SDP) provides a powerful relaxation for the maximum cut problem. In this work, we characterize a few classes of graphs for which the SDP relaxation is exa…