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 to ...

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 ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Transactions of the American Mathematical Society, Vol. 223 (Oct., 1976), pp. 103-131 (29 pages) This paper demonstrates a Remez exchange algorithm applicable to approximation of real-valued ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...