Shapley meets Shapley
From MaRDI portal
Publication:2965476
DOI10.4230/LIPIcs.STACS.2014.99zbMath1359.68116arXiv1307.0332OpenAlexW2962998749MaRDI QIDQ2965476
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1307.0332
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (6)
The stable fixtures problem with payments ⋮ Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability ⋮ Efficient stabilization of cooperative matching games ⋮ Unnamed Item ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ Unnamed Item
This page was built for publication: Shapley meets Shapley
