scientific article; zbMATH DE number 7650074

DOI10.4230/LIPICS.APPROX-RANDOM.2019.7MaRDI QIDQ5875458FDOQ5875458

Authors: Alon Eden, Michal Feldman, Uriel Feige 

Publication date: 3 February 2023

Title of this publication is not available (Why is that?)

Recommendations

• Max-min greedy matching
• Greedy matching: guarantees and limitations
• Randomized greedy matching
• scientific article; zbMATH DE number 866672
• scientific article; zbMATH DE number 1003244
• The minimum maximal k-partial-matching problem
• Max-min matching problems with multiple assignments
• Greedy Matching on the Line
• On min-max theorems in matching theory

zbMATH Keywords

marketsonline matchingpricing mechanism

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• College Admissions and the Stability of Marriage
• Title not available (Why is that?)
• Online bipartite matching with unknown distributions
• Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
• Short Tours through Large Linear Forests
• Approximation hardness of edge dominating set problems
• Combinatorial auctions via posted prices
• Computing Walrasian equilibria: fast algorithms and structural properties
• Title not available (Why is that?)

Cited In (5)

• Max-min greedy matching problem: hardness for the adversary and fractional variant
• Max-min greedy matching
• Greedy Matching on the Line
• Max-min greedy matching problem: hardness for the adversary and fractional variant
• Greedy matching: guarantees and limitations

Uses Software

• Sociodynamica

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875458)