It has been observed that the Handelman’s certificate of positivity of a polynomial over a compact polyhedron offers a hierarchical relaxation scheme for polynomial programs. The Handelman hierarchy seems particularly suitable for a class of combinatorial optimizations that are formulated as a...

We provide motivations for the correlated equilibrium solution concept from the game-theoretic and optimization perspectives. We then propose an algorithm that computes <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\varepsilon}$$</EquationSource> </InlineEquation> -correlated equilibria with global-optimal (i.e., maximum) expected social welfare for normal form...</equationsource></inlineequation>

In this paper we develop probabilistic arguments for justifying thequality of an approximate solution for global quadratic minimization problem, obtained as a best point among all points of a uniform grid inside a polyhedral feasible set. Our main tool is a random walk inside the standard...