Making Three Out of Two: Three-Way Online Correlated Selection

07/06/2021
by   Yongho Shin, et al.
0

Two-way online correlated selection (two-way OCS) is an online algorithm that, at each timestep, takes a pair of elements from the ground set and irrevocably chooses one of the two elements, while ensuring negative correlation in the algorithm's choices. Whilst OCS was initially invented by Fahrbach, Huang, Tao, and Zadimoghaddam to solve the edge-weighted online bipartite matching problem, it is an interesting technique on its own due to its capability of introducing a powerful algorithmic tool, namely negative correlation, to online algorithms. As such, Fahrbach et al. posed two tantalizing open questions in their paper, one of which was the following: Can we obtain n-way OCS for n>2, in which the algorithm can be given n>2 elements to choose from at each timestep? In this paper, we affirmatively answer this open question by presenting a three-way OCS. Our algorithm uses two-way OCS as its building block and is simple to describe; however, as it internally runs two instances of two-way OCS, one of which is fed with the output of the other, the final output probability distribution becomes highly elusive. We tackle this difficulty by approximating the output distribution of OCS by a flat, less correlated function and using it as a safe "surrogate" of the real distribution. Our three-way OCS also yields a 0.5093-competitive algorithm for edge-weighted online matching, demonstrating its usefulness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2021

Improved Online Correlated Selection

This paper studies the online correlated selection (OCS) problem introdu...
research
10/08/2019

Understanding Zadimoghaddam's Edge-weighted Online Matching Algorithm: Weighted Case

This article presents a simplification of Zadimoghaddam's algorithm for ...
research
06/10/2021

Multiway Online Correlated Selection

We give a 0.5368-competitive algorithm for edge-weighted online bipartit...
research
05/05/2020

Edge-Weighted Online Bipartite Matching

Online bipartite matching and its variants are among the most fundamenta...
research
10/07/2019

Understanding Zadimoghaddam's Edge-weighted Online Matching Algorithm: Unweighted Case

This article identifies a key algorithmic ingredient in the edge-weighte...
research
09/09/2020

Adwords in a Panorama

Three decades ago, Karp, Vazirani, and Vazirani (STOC 1990) defined the ...
research
03/06/2022

The Power of Multiple Choices in Online Stochastic Matching

We study the power of multiple choices in online stochastic matching. De...

Please sign up or login with your details

Forgot password? Click here to reset