The "nearest neighbor (NN) classifier" labels a new data instance by taking a majority vote over the k most similar instances seen in the past. With an appropriate setting of k, it is capable of modeling arbitrary decision rules.

Information theoretically secure multiparty computation (MPC) is a central primitive in modern cryptography.

Partial function extension is a basic problem that underpins multiple research topics in optimization, including learning, property testing, and game theory.

We consider the problem of dividing indivisible resources among a set of agents ``fairly''.