Journal article by Ata Atay and Marina Núñez accepted for publication in the Annals of Operations Research

Title: Multi-sided assignment games on m-partite graphs
Authors: Ata Atay & Marina Núñez
First online: 21 May 2019

Download open access version here.

Abstract

We consider a multi-sided assignment game with the following characteristics: (a) the agents are organized in m sectors that are connected by a graph that induces a weighted m-partite graph on the set of agents, (b) a basic coalition is formed by agents from different connected sectors, and (c) the worth of a basic coalition is the addition of the weights of all its pairs that belong to connected sectors. We provide a sufficient condition on the weights to guarantee balancedness of the related multi-sided assignment game. Moreover, when the graph on the sectors is cycle-free, we prove the game is strongly balanced and the core is fully described by means of the cores of the underlying two-sided assignment games associated with the edges of this graph. As a consequence, the complexity of the computation of an optimal matching is reduced and existence of optimal core allocations for each sector of the market is guaranteed.

2024

Mar

28

M

T

W

T

F

S

S

26

27

28

29

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

1

2

3

4

5

6

7

Next month >
a

2024

Mar

28

M

T

W

T

F

S

S

26

27

28

29

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

1

2

3

4

5

6

7

Next month >