论文信息 - On the Lower Bound of the Competitive Ratio for the Weighted Online Roommates Problem

On the Lower Bound of the Competitive Ratio for the Weighted Online Roommates Problem

We show that the best possible worst case competitive ratio of any deterministic algorithm for weighted online roommates problem is arbitrarily close to 4. This proves that the 4-competitive algorithm proposed by Bernstein and Rajagopalan [3] for the weighted version of the online roommates problem actually attains the best possible competitive ratio.

Satyajit Banerjee

[1] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.

[2] Sanjoy K. Baruah,et al. On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.

[3] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[4] Bala Kalyanasundaram,et al. On-line weighted matching , 1991, SODA '91.

[5] Ethan Bernstein,et al. The Roommates Problem , 1993 .