Finding and Recognizing Popular Coalition Structures

DOI10.1613/JAIR.1.13470MaRDI QIDQ5094026zbMATH OpenOpenAlexFDO

Authors Felix Brandt, Martin Bullinger

Publication date 2 August 2022

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.13470

zbMATH Keywords

multiagent systems

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Computing desirable partitions in additively separable hedonic games
• Pareto optimality in coalition formation
• The stability of hedonic coalition structures
• Hedonic games
• Pareto optimality in coalition formation

Cites work

• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• 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
• 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 in Complete Graphs
• Popular matchings and limits to tractability
• 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 Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
• The Stable Roommates Problem with Globally Ranked Pairs
• The ellipsoid method and its consequences in combinatorial optimization
• The stability of hedonic coalition structures
• Theory of games and economic behavior.
• Two problems in max-size popular matchings

Cited in

(3)

• Stability based on single-agent deviations in additively separable hedonic games
• Popularity on the roommate diversity problem
• Popularity on the roommate diversity problem

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)