Finding and Recognizing Popular Coalition Structures
From MaRDI portal
(Redirected from Publication:5094026)
Recommendations
Cites work
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- An analytical and experimental comparison of maximal lottery schemes
- Arrovian aggregation of convex preferences
- Computing desirable partitions in additively separable hedonic games
- Consistent probabilistic social choice
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Fractional covers for forests and matchings
- Hedonic Coalitions: Optimality and Stability
- Hedonic games
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- NP-completeness in hedonic games
- On popular random assignments
- On the tradeoff between efficiency and strategyproofness
- Optimal popular matchings
- Pareto optimality in coalition formation
- Popular Matchings
- Popular matchings and limits to tractability
- Popular Matchings in Complete Graphs
- Popular matchings in the marriage and roommates problems
- Popular matchings in the stable marriage problem
- Popular matchings with two-sided preferences and one-sided ties
- Popular mixed matchings
- Popularity, mixed matchings, and self-duality
- Popularity, Mixed Matchings, and Self-Duality
- Probabilistic Social Choice Based on Simple Voting Comparisons
- Reducibility among combinatorial problems
- The ellipsoid method and its consequences in combinatorial optimization
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- The stability of hedonic coalition structures
- The Stable Roommates Problem with Globally Ranked Pairs
- Theory of games and economic behavior.
- Two problems in max-size popular matchings
Cited in
(8)- Stability based on single-agent deviations in additively separable hedonic games
- Popularity on the roommate diversity problem
- Popularity on the roommate diversity problem
- The popular matching problem in the roommates instance remains NP-hard in bounded degree graphs
- Stability in online coalition formation
- Defensive alliances in signed networks
- Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs
- Popularity on the 3D-Euclidean stable roommates
This page was built for publication: Finding and Recognizing Popular Coalition Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094026)
