Month: November 2026

String-averaging bargaining in solidarity cooperative games

Categories Applications - OR and Management Sciences, Convex Optimization, Game Theory Tags , , , ,

We consider the situation that the grand set of all players, in a cooperative game in characteristic function form with a nonempty core, consists of recognizable subsets of players. The underlying assumption is that the players of each subset have something in common between themselves which is not shared by the players of other subsets. … Read more

Cubic Optimization over Three Nonnegative Integers Is NP-hard

Categories (Mixed) Integer Nonlinear Programming, Global Optimization Theory Tags , , ,

We prove that deciding whether an integer cubic polynomial takes a value at most one over three nonnegative integers is NP-hard. Hardness holds even when every feasible objective value is a positive integer, so every constructed instance has a finite, attained minimum. This establishes a sharp dimension boundary for the tractability of cubic integer optimization … Read more