In practice, the actual approximation factor is far better; we provide a specific example by generating a nearly-optimal inter-league tournament for the 30-team National Basketball Association, with ...

Nash equilibria represent a cornerstone in game theory, defining strategy profiles wherein no player can benefit by unilaterally deviating. This concept underpins a myriad of applications, ranging ...

Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design. Researchers are dedicated ...

Understand how approximation algorithms compute solutions that are guaranteed to be within some constant factor of the optimal solution. Develop a basic understanding of how linear and integer ...

Although efficient in a strictly theoretical sense (i.e., in the sense of taking polynomial versus exponential time), this algorithm for the permanent is not practical. Indeed, to date, no practical ...

The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400—407]. After five decades of continual development, it has developed into an important area ...