A unifying model for matrix-based pairing situations

DOI10.1016/J.MATHSOCSCI.2014.09.003zbMATH Open1308.91026OpenAlexW2029144161MaRDI QIDQ477792FDOQ477792

Authors: Oriol Tejada, Peter Borm, Edwin Lohmann 

Publication date: 9 December 2014

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2014.09.003

Recommendations

• The core of the matching game
• Cores of combined games
• Cooperative games in permutational structure
• Assignment games with stable core
• Pairwise mergers in bipartite matching games with an application in collaborative logistics

Mathematics Subject Classification ID

Cooperative games (91A12)

Cites Work

• The assignment game. I: The core
• On one-sided versus two-sided matching games
• Title not available (Why is that?)
• Computing the nucleolus of cyclic permutation games
• Permutation games: Another class of totally balanced games
• Core and competitive equilibria with indivisibilities
• Buyer-seller exactness in the assignment game
• Assignment markets with the same core

Cited In (2)

• Models and methods for pairing data
• Pairwise mergers in bipartite matching games with an application in collaborative logistics

This page was built for publication: A unifying model for matrix-based pairing situations

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