Keresés
Keresés
Close this search box.

hu / en

Schlotter Ildikó és Cseh Ágnes új tanulmánya megjelent az ACM Transactions on Computation Theory szakfolyóiratban

Maximum-utility Popular Matchings with Bounded Instability

 Ildikó Schlotter – Ágnes Cseh 


ACM Transactions on Computation Theory, Volume 17, Issue 1
Article No.: 6, Pages 1 – 35 – Published: 08 March 2025

 

Abstract

In a graph where vertices have preferences over their neighbors, a matching is called popular if it does not lose a head-to-head election against any other matching when the vertices vote between the matchings. Popular matchings can be seen as an intermediate category between stable matchings and maximum-size matchings. In this article, we aim to maximize the utility of a matching that is popular but admits only a few blocking edges.
We observe that, for general graphs, finding a popular matching with at most one blocking edge is already NP-complete. For bipartite instances, we study the problem of finding a maximum-utility popular matching with a bound on the number (or, more generally, the cost) of blocking edges applying a multivariate approach. We show classical and parameterized hardness results for severely restricted instances. By contrast, we design an algorithm for instances where preferences on one side admit a master list and show that this algorithm is roughly optimal.
 
 
 
 
 
 

2025

Jún

04

H

K

Sz

Cs

P

Sz

V

26

27

28

29

30

31

1

2

3

4

6

7

8

9

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

1

2

3

4

5

6

Következő hónap >