A pairwise-monotonic core selection for permutation games

DOI10.1007/S00186-008-0281-2MaRDI QIDQ1044216zbMATH OpenOpenAlexFDO

Authors Silvia Miquel

Publication date 11 December 2009

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-008-0281-2

zbMATH Keywords

corepermutation game\(\tau\)-valuepairwise-monotonicity

Mathematics Subject Classification ID

Cooperative games (91A12) Other game-theoretic models (91A40)

Recommendations

• Bargaining sets and the core in permutation games
• Publication:4724438
• The kernel is in the least core for permutation games
• Aggregate monotonic stable single-valued solutions for cooperative games
• Cooperative games in permutational structure

Cites work

• scientific article; zbMATH DE number 3997573 (Why is no real title available?)
• Monotonic solutions of cooperative games
• On one-sided versus two-sided matching games
• Permutation games: Another class of totally balanced games
• The assignment game. I: The core
• The assignment game: the \(\tau\)-value

Cited in

(2)

• A monotone iterative method for solving the combinatorial game-type optimization problems on permutations
• Monotonic core allocation paths for assignment games

This page was built for publication: A pairwise-monotonic core selection for permutation games

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