Article thumbnail
Location of Repository

Robust randomized matchings

By Jannik Matuschke, Martin Skutella and José Soto

Abstract

The following game is played on a weighted graph: Alice selects a matching M and Bob selects a number k. Alice’s payoff is the ratio of the weight of the k heaviest edges of M to the maximum weight of a matching of size at most k. If M guarantees a payoff of at least α then it is called α-robust. Hassin and Rubinstein [7] gave an algorithm that returns a 1/ √ 2-robust matching, which is best possible. We show that Alice can improve her payoff to 1/ ln(4) by playing a randomized strategy. This result extends to a very general class of independence systems that includes matroid intersection, b-matchings, and strong 2-exchange systems. It also implies an improved approximation factor for a stochastic optimization variant known as the maximum priority matching problem and translates to an asymptotic robustness guarantee for deterministic matchings, in which Bob can only select numbers larger than a given constant. Moreover, we give a new LP-based proof of Hassin and Rubinstein’s bound

Topics: Mathematics (all), Computer Science Applications, Management Science and Operations Research
Publisher: 'Institute for Operations Research and the Management Sciences (INFORMS)'
Year: 2018
DOI identifier: 10.1287/moor.2017.0878
OAI identifier: oai:repositorio.uchile.cl:2250/169408
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://repositorio.uchile.cl/h... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.