Multiparty Selection

04/12/2020
by   Ke Chen, et al.
0

Given a sequence A of n numbers and an integer (target) parameter 1≤ i≤ n, the (exact) selection problem asks to find the i-th smallest element in A. An element is said to be (i,j)-mediocre if it is neither among the top i nor among the bottom j elements of S. The approximate selection problem asks to find a (i,j)-mediocre element for some given i,j; as such, this variant allows the algorithm to return any element in a prescribed range. In the first part, we revisit the selection problem in the two-party model introduced by Andrew Yao (1979) and then extend our study of exact selection to the multiparty model. In the second part, we deduce some communication complexity benefits that arise in approximate selection. In particular, we present a deterministic protocol for finding an approximate median among k players.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2022

Approximate Selection with Unreliable Comparisons in Optimal Expected Time

Given n elements, an integer k and a parameter ε, we study to select an ...
research
01/30/2021

Fragile Complexity of Adaptive Algorithms

The fragile complexity of a comparison-based algorithm is f(n) if each i...
research
11/03/2022

Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm

Given two sets A=a_1,a_2,...,a_s and b_1,b_2,...,b_t, a many-to-many mat...
research
11/21/2020

Improved Dynamic Algorithms for Longest Increasing Subsequence

We study dynamic algorithms for the longest increasing subsequence (LIS)...
research
11/30/2017

Element Distinctness Revisited

The element distinctness problem is the problem of determining whether t...
research
07/04/2023

Cross-Element Combinatorial Selection for Multi-Element Creative in Display Advertising

The effectiveness of ad creatives is greatly influenced by their visual ...
research
01/25/2019

Finding a Mediocre Player

Consider a totally ordered set S of n elements; as an example, a set of ...

Please sign up or login with your details

Forgot password? Click here to reset