Cooperation in Multiorganization Matching

DOI10.1007/978-3-540-93980-1_7MaRDI QIDQ3602831zbMATH OpenOpenAlexFDO

Authors Laurent Gourvès, Jérôme Monnot, Fanny Pascual

Publication date 12 February 2009

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-93980-1_7

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Matching models (91B68)

Recommendations

• Cooperation in multiorganization matching
• The stable fixtures problem with payments
• Three-sided stable matching problem with two of them as cooperative partners
• Designing profit shares in matching and coalition formation games
• Efficiency and equity in the multi organization scheduling problem

Cites work

• A course in game theory.
• Assignment problems: a golden anniversary survey
• Cooperation in Multi-organization Scheduling
• Exact arborescences, matchings and cycles
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2079324 (Why is no real title available?)
• Matching is as easy as matrix inversion
• Maximum matching of given weight in complete and complete bipartite graphs
• The assignment game. I: The core
• The complexity of restricted spanning tree problems
• The Price of Stability for Network Design with Fair Cost Allocation

Cited in

(2)

• Cooperation in multiorganization matching
• Network sharing by two mobile operators: beyond competition, cooperation

This page was built for publication: Cooperation in Multiorganization Matching

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