Related papers: Gravitational allocation for uniform points on the…

The dilation of a Euclidean graph is defined as the ratio of distance in the graph divided by distance in R^d. In this paper we consider the problem of positioning the root of a star such that the dilation of the resulting star is minimal.…

We model the societal task of redistricting political districts as a partitioning problem: Given a set of $n$ points in the plane, each belonging to one of two parties, and a parameter $k$, our goal is to compute a partition $\Pi$ of the…

Analyzing the spacetime for a static spherically distributed perfect fluid we show that the smooth matching of the interior and exterior metrics for a realistic source is possible only for the distances from the origin that exceeds the…

When selecting locations for a set of facilities, standard clustering algorithms may place unfair burden on some individuals and neighborhoods. We formulate a fairness concept that takes local population densities into account. In…

An approach is developed to find approximate solutions to the classical Newtonian problem of N bodies. Sets of N gravitating bodies having spherically symmetric mass distributions, small angular velocities (< 1 rad/s) and bounded position…

$\newcommand{\ball}{\mathbb{B}}\newcommand{\dsQ}{{\mathcal{Q}}}\newcommand{\dsS}{{\mathcal{S}}}$In this work we study a fair variant of the near neighbor problem. Namely, given a set of $n$ points $P$ and a parameter $r$, the goal is to…

The apportionment problem deals with the fair distribution of a discrete set of $k$ indivisible resources (such as legislative seats) to $n$ entities (such as parties or geographic subdivisions). Highest averages methods are a frequently…

Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.

It is often of interest to identify a given number of points in projective space such that the minimum distance between any two points is as large as possible. Such configurations yield representations of data that are optimally robust to…

Let $\Theta^{(n)}$ be a random vector uniformly distributed on the unit sphere $\mathbb S^{n-1}$ in $\mathbb R^n$. Consider the projection of the uniform distribution on the cube $[-1,1]^n$ to the line spanned by $\Theta^{(n)}$. The…

We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share must form a connected subgraph of this graph. This framework…

Balls are sequentially allocated into $n$ bins as follows: for each ball, an independent, uniformly random bin is generated. An overseer may then choose to either allocate the ball to this bin, or else the ball is allocated to a new…

This paper focuses on designing a unified approach for computing the projection onto the intersection of an $\ell_1$ ball/sphere and an $\ell_2$ ball/sphere. We show that the major computational efforts of solving these problems all rely on…

In this paper, we prove a geometrical inequality which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is 4+4*sqrt(2). In our method, we have constructed a rectangular…

We extend the fair machine learning literature by considering the problem of proportional centroid clustering in a metric context. For clustering $n$ points with $k$ centers, we define fairness as proportionality to mean that any $n/k$…

Given $2\le k\le n$, the minimal $(n-1)$-dimensional Gaussian measure of the union of the boundaries of $k$ disjoint sets of equal Gaussian measure in $\R^n$ whose union is $\R^n$ is of order $\sqrt{\log k}$. A similar results holds also…

We consider the division of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we characterize the optimal allocations and we develop two exact…

A new formalism is presented for analytically obtaining the probability density function, \( P_{n}(s) \), for the distance between two random points in an \( n \)-dimensional sphere of radius \( R \). Our formalism allows \( P_{n}(s) \) to…

Given a set of N points, we have discovered an algorithm that can separate these points from one another by n-dimensional planes. Each point is chosen at random and put into a set S and planes which separate them are determined and put into…

We study the fair division of indivisible goods with conflicts between pairs of goods, represented by a graph $G = (V, E)$. We consider ``soft'' conflicts: assigning two adjacent goods to the same agent is allowed, but we seek allocations…