Algorithmic graph theory and optimisation represents a critical nexus between discrete mathematics and computer science, underpinning the development of efficient methodologies for analysing complex ...

Convex geometry and combinatorial optimisation form a vibrant nexus of research that bridges theoretical mathematics with practical algorithm design. The study of convex sets and their structural ...

Game theory explains competitive behavior by working from the premise that people are self-interested. People don’t just compete, however; they also cooperate. In “How We Cooperate,” John Roemer ...

This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

Multi-Objective Optimization in Theory and Practice is a simplified two-part approach to multi-objective optimization (MOO) problems. This second part focuses on the use of metaheuristic algorithms in ...

where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...