Arnab Bhattacharyya, Davin Choo, Chun Ling, Themis Gouleakis
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. If it links a repository, it is listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study the problem of online unweighted bipartite matching with n offline vertices and n online vertices where one wishes to be competitive against the optimal offline algorithm. While the classic Ranking algorithm of Karp et al. [1990] provably attains competitive ratio of 1 -1/e > 1/2, we show that no learningaugmented method can be both 1-consistent and strictly better than 1/2-robust under the adversarial arrival model. Meanwhile, under the random arrival model, we show how one can utilize methods from distribution testing to design an algorithm that takes in external advice about the online vertices and provably achieves competitive ratio interpolating between any ratio attainable by advice-free methods and the optimal ratio of 1, depending on the advice quality.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2405.09784")
get_code_for_paper("2405.09784")
have("2405.09784")
Connect an agent — have() is free.