On the performance of mildly greedy players in cut games

Vittorio Bilò; Mauro Paladini

doi:10.1007/s10878-015-9898-2

On the performance of mildly greedy players in cut games

Journal of Combinatorial Optimization ◽

10.1007/s10878-015-9898-2 ◽

2015 ◽

Vol 32 (4) ◽

pp. 1036-1051 ◽

Cited By ~ 1

Author(s):

Vittorio Bilò ◽

Mauro Paladini

Keyword(s):

Cut Games

Download Full-text

Coalition Resilient Outcomes in Max k-Cut Games

SOFSEM 2019: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-10801-4_9 ◽

2019 ◽

pp. 94-107 ◽

Cited By ~ 2

Author(s):

Raffaello Carosi ◽

Simone Fioravanti ◽

Luciano Gualà ◽

Gianpiero Monaco

Keyword(s):

Cut Games

Download Full-text

On the Performance of Mildly Greedy Players in Cut Games

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_44 ◽

2014 ◽

pp. 513-524 ◽

Cited By ~ 1

Author(s):

Vittorio Bilò ◽

Mauro Paladini

Keyword(s):

Cut Games

Download Full-text

Cycle games and cycle cut games

COMBINATORICA ◽

10.1007/bf02579294 ◽

1983 ◽

Vol 3 (2) ◽

pp. 201-206 ◽

Cited By ~ 3

Author(s):

Mikio Kano

Keyword(s):

Cut Games

Download Full-text