Pareto optimality in coalition formation
From MaRDI portal
Publication:2437839
DOI10.1016/j.geb.2013.08.006zbMath1283.91011OpenAlexW2030237310MaRDI QIDQ2437839
Paul Harrenstein, Haris Aziz, Felix Brandt
Publication date: 13 March 2014
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2013.08.006
Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)
Related Items
Group activity selection problem with approval preferences ⋮ Altruistic Hedonic Games ⋮ Pareto Optimal Matchings in Many-to-Many Markets with Ties ⋮ Finding and Recognizing Popular Coalition Structures ⋮ Computational aspects of assigning agents to a line ⋮ Hedonic expertise games ⋮ The vigilant eating rule: a general approach for probabilistic economic design with constraints ⋮ Hedonic diversity games: a complexity picture with more than two colors ⋮ Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games ⋮ Stable and Pareto optimal group activity selection from ordinal preferences ⋮ Efficient reallocation under additive and responsive preferences ⋮ Universal Pareto dominance and welfare for plausible utility functions ⋮ Borda-induced hedonic games with friends, enemies, and neutral players ⋮ Size versus truthfulness in the house allocation problem ⋮ Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games ⋮ Matching with ownership ⋮ On the convergence of swap dynamics to Pareto-optimal matchings ⋮ On Pareto optimality in social distance games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The stability of hedonic coalition structures
- Exchange of indivisible goods and indifferences: the top trading absorbing sets mechanisms
- Computing equilibria: a computational complexity perspective
- Packings by cliques and by finite families of graphs
- On the existence of fair matching algorithms
- Packing subgraphs in a graph
- A problem in discrete distributive justice
- Top dominance and the possibility of strategy-proof stable solutions to matching problems
- House allocation with existing tenants
- Stable partitions with \(\mathcal W\)-preferences
- On cores and indivisibility
- NP-completeness in hedonic games
- The roommates problem revisited
- Three-sided stable matchings with cyclic preferences
- Core in a simple coalition formation game
- Reducing rank-maximal to maximum weight matching
- A strategic model of social and economic networks
- Three-Dimensional Stabl Matching Problems
- NP-complete stable matching problems
- Hedonic Coalitions: Optimality and Stability
- The Economics of Matching: Stability and Incentives
- Faster scaling algorithms for general graph matching problems
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Paths, Trees, and Flowers
- Algorithms and Computation
- On the Shapley-Scarf economy: The case of multiple types of indivisible goods
- On the complexity of exchange-stable roommates
This page was built for publication: Pareto optimality in coalition formation
