Finding and Recognizing Popular Coalition Structures

DOI10.1613/jair.1.13470OpenAlexW3037692074MaRDI QIDQ5094026

Martin Bullinger, Felix Brandt

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing desirable partitions in additively separable hedonic games
• Popular mixed matchings
• The stability of hedonic coalition structures
• Optimal popular matchings
• The ellipsoid method and its consequences in combinatorial optimization
• On the tradeoff between efficiency and strategyproofness
• NP-completeness in hedonic games
• Two problems in max-size popular matchings
• Pareto optimality in coalition formation
• An analytical and experimental comparison of maximal lottery schemes
• On Popular Random Assignments
• Popular Matchings in the Stable Marriage Problem
• Fractional covers for forests and matchings
• Probabilistic Social Choice Based on Simple Voting Comparisons
• Popular Matchings with Two-Sided Preferences and One-Sided Ties
• Popular Matchings
• Popular Matchings in the Marriage and Roommates Problems
• The Stable Roommates Problem with Globally Ranked Pairs
• Hedonic Coalitions: Optimality and Stability
• Popularity, Mixed Matchings, and Self-duality
• Consistent Probabilistic Social Choice
• Arrovian Aggregation of Convex Preferences
• Reducibility among Combinatorial Problems
• Popularity, Mixed Matchings, and Self-Duality
• Popular Matching in Roommates Setting Is NP-hard
• Popular Matchings in Complete Graphs
• Hedonic Games
• Popular Matchings and Limits to Tractability
• Algorithmics of Matching Under Preferences
• A Size-Popularity Tradeoff in the Stable Marriage Problem
• The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
• Maximum matching and a polyhedron with 0,1-vertices
• Finding strongly popular \(b\)-matchings in bipartite graphs
• On the existence of three-dimensional stable matchings with cyclic preferences

This page was built for publication: Finding and Recognizing Popular Coalition Structures