Relaxation and Decomposition -- Simplifying via Reformulation, Approximation, and Relaxation -- Approximating and Relaxing Optimization Problems -- Learning-Assisted Relaxations and Approximations -- Solving Optimization Problems with Complicating Variables -- Solving Optimization Problems via...

We analyze information design games between two designers with opposite preferences and a single agent. Before the agent makes a decision, designers repeatedly disclose public information about persistent state parameters. Disclosure continues until no designer wishes to reveal further...

In a single-objective setting, nonconvex quadratic problems can equivalently be reformulated as convex problems over the cone of completely positive matrices. In small dimensions this cone equals the cone of matrices which are entrywise nonnegative and positive semidefinite, so the convex...