arXiv subjects
Publications and source records attributed to Andrei V. Malyutin.
We study the algorithmic complexity of fair division problems with a focus on minimizing the number of queries needed to find an approximate solution with desired accuracy. We show for several classes of fair division problems that under certain natural conditions on sets of preferences, a logarithmic number of queries with respect to accuracy is sufficient.
We introduce and study a new family of extensions for the Borsuk-Ulam and topological Radon type theorems. The defining idea for this new family is to replace requirements of the form `a subset that is large in some sense goes to a singleton' with requirements of the milder form `a subset that is large in some sense goes to a subset that is small in some sense'. This approach covers the case of mappings m-sphere to n-space with m<n and extends to wider classes of spaces.
We show that if $K$ is a nontrivial knot then the proportion of satellites of $K$ among all of the prime non-split links of $n$ or fewer crossings does not converge to $0$ as $n$ approaches infinity. This implies in particular that the proportion of hyperbolic links among all of the prime non-split links of $n$ or fewer crossings does not converge to 1 as $n$ approaches infinity. We consider unoriented link types.