Distributed Stable Matching Problems

DOI10.1007/11564751_14MaRDI QIDQ3524171zbMATH OpenOpenAlexFDO

Authors Ismel Brito, P. Meseguer

Publication date 9 September 2008

Published in Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11564751_14

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Matching models (91B68)

Recommendations

• Dynamic and self-stabilizing distributed matching
• Distributed near-optimal matching
• Distributed near-optimal matching
• Fast distributed almost stable matchings
• Distributed stable matching with similar preference lists
• Distributed Weighted Stable Marriage Problem
• Distributed match-making

Cited in

(13)

• Improved Efficiency for Private Stable Matching
• An advanced parking navigation system for downtown parking
• Fast distributed almost stable matchings
• Self-stabilizing distributed stable marriage
• Distributed Weighted Stable Marriage Problem
• scientific article; zbMATH DE number 1689600 (Why is no real title available?)
• A Private Stable Matching Algorithm
• Multi-agent reinforcement learning for decentralized stable matching
• From Marriages to Coalitions: A Soft CSP Approach
• Distributed constraint satisfaction with partially known constraints
• Stable matching with proportionality constraints
• Stability, optimality and manipulation in matching problems with weighted preferences
• Verification protocol for stable matching from conditional disclosure of secrets

This page was built for publication: Distributed Stable Matching Problems

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