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

A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f, for assigning item j to bin i; and a separate packing constraint for each bin—i.e., ...

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