Special issue: Selected papers based on the presentations at the workshop ``Match-UP: Matching under preferences -- algorithms and complexity, Reykjavík, Iceand, July 2008

MaRDI QIDQ983516zbMATH OpenFDO

Authors

Publication date 23 July 2010

Published in Algorithmica (Search for Journal in Brave)

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Recommendations

• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• Editorial: Special issue on matching under preferences
• Selected open problems in matching under preferences
• When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract)
• Stochastic Matching with Few Queries: New Algorithms and Tools
• Online stochastic matching: new algorithms and bounds
• New algorithms, better bounds, and a novel model for online stochastic matching
• Improved approximation algorithms for stochastic matching
• On randomized algorithms for matching in the online preemptive model
• On preferences over subsets and the lattice structure of stable matchings

This page was built for publication: Special issue: Selected papers based on the presentations at the workshop ``Match-UP: Matching under preferences -- algorithms and complexity, Reykjavík, Iceand, July 2008

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