On the Complexity of Nucleolus Computation for Bipartite b-Matching Games

05/15/2021
by   Jochen Koenemann, et al.
0

We explore the complexity of nucleolus computation in b-matching games on bipartite graphs. We show that computing the nucleolus of a simple b-matching game is NP-hard even on bipartite graphs of maximum degree 7. We complement this with partial positive results in the special case where b values are bounded by 2. In particular, we describe an efficient algorithm when a constant number of vertices satisfy b(v) = 2 as well as an efficient algorithm for computing the non-simple b-matching nucleolus when b = 2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2021

Efficient Algorithm for Checking 2-Chordal (Doubly Chordal) Bipartite Graphs

We present an algorithm for determining whether a bipartite graph G is 2...
research
05/26/2018

Popular Matchings and Limits to Tractability

We consider popular matching problems in both bipartite and non-bipartit...
research
02/09/2022

Weighted Connected Matchings

A matching M is a 𝒫-matching if the subgraph induced by the endpoints of...
research
08/19/2019

An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences

As a partial answer to a question of Rao, a deterministic and customizab...
research
09/06/2013

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

We provide an elementary proof of a simple, efficient algorithm for comp...
research
03/01/2023

The Total Matching Polytope of Complete Bipartite Graphs

The total matching polytope generalizes the stable set polytope and the ...
research
01/25/2022

An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem

The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard...

Please sign up or login with your details

Forgot password? Click here to reset