Borda-induced hedonic games with friends, enemies, and neutral players
From MaRDI portal
Publication:2317997
DOI10.1016/j.mathsocsci.2018.08.003zbMath1422.91070OpenAlexW2889518692WikidataQ129318264 ScholiaQ129318264MaRDI QIDQ2317997
Jörg Rothe, Hilmar Schadrack, Lena Schend
Publication date: 13 August 2019
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2018.08.003
Cooperative games (91A12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Control complexity in Borda elections: solving all open cases of offline control and some cases of online control, Local fairness in hedonic games via individual threshold coalitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games
- Computing desirable partitions in additively separable hedonic games
- Voting almost maximizes social welfare despite limited communication
- The stability of hedonic coalition structures
- Strategy-proof, efficient, and nonbossy quota allocations
- Fair assignment of indivisible objects under ordinal preferences
- Stable marriage with ties and bounded length preference lists
- Computational complexity in additive hedonic games
- Some remarks on the stable matching problem
- The polynomial-time hierarchy
- Stable marriage and indifference
- Stability in coalition formation games
- Computational complexity of stable partitions with b-preferences
- Hard variants of stable marriage.
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- Coalition formation games with separable preferences.
- Stable partitions with \(\mathcal W\)-preferences
- Fair division of indivisible items
- NP-completeness in hedonic games
- A hardness result for core stability in additive hedonic games
- Core in a simple coalition formation game
- Simple priorities and core stability in hedonic games
- Pareto optimality in coalition formation
- Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems
- On core membership testing for hedonic coalition formation games
- Core Stability in Hedonic Coalition Formation
- Nash Stability in Fractional Hedonic Games
- Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
- Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation
- The Stable Roommates Problem with Ties
- NP-complete stable matching problems
- An efficient algorithm for the “stable roommates” problem
- Hedonic Games
- Mathematical Derivation of an Election System
- College Admissions and the Stability of Marriage
