Maximizing Social Welfare in Score-Based Social Distance Games

DOI10.4204/eptcs.379.22arXiv2307.05061OpenAlexW4383645826MaRDI QIDQ6199615

Ondřej Suchý, Sanjukta Roy, Dušan Knop, Šimon Schierreich, Thekla Hamm, Robert Ganian

Publication date: 28 February 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.05061

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Hedonic coalition formation games: a new stability notion
• The stability of hedonic coalition structures
• Distance hedonic games
• Treewidth. Computations and approximations
• On the price of stability of social distance games
• On Pareto optimality in social distance games
• Optimal partition of a tree with social distance
• On myopic stability concepts for hedonic games
• Integer programming in parameterized complexity: five miniatures
• Graph Theory
• OWA-Based Extensions of the Chamberlin–Courant Rule
• Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation
• Parameterized Complexity Results for Exact Bayesian Network Structure Learning
• On Non-Cooperativeness in Social Distance Games
• An Experimental Study of the Treewidth of Real-World Graph Data
• Handbook of Computational Social Choice
• Parameterized Algorithms
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Maximizing Social Welfare in Score-Based Social Distance Games