scientific article; zbMATH DE number 7650074

DOI10.4230/LIPICS.APPROX-RANDOM.2019.7MaRDI QIDQ5875458zbMATH OpenFDO

Authors Alon Eden, Michal Feldman, Uriel Feige

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.7

zbMATH Keywords

marketsonline matchingpricing mechanism

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(5)

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

Describes a project that uses

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)