AI Chat AI Image Generator AI Video AI Music Generator

Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time

03/08/2018

∙

by Jochen Koenemann, et al.

∙

∙

We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. This resolves a long-standing open question of [Kern and Paulusma, Mathematics of Operations Research, 2003].

Jochen Koenemann
8 publications
Kanstantsin Pashkovich
12 publications
Justin Toth
3 publications

page 1

page 2

page 3

page 4

research

∙ 10/03/2018

Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time

We provide an algorithm for computing the nucleolus for an instance of a...

0 Kanstantsin Pashkovich, et al. ∙

research

∙ 05/21/2020

A General Framework for Computing the Nucleolus Via Dynamic Programming

This paper defines a general class of cooperative games for which the nu...

0 Jochen Koenemann, et al. ∙

research

∙ 05/06/2021

A model for cooperative scientific research inspired by the ant colony algorithm

Modern scientific research has become largely a cooperative activity in ...

0 Zhuoran He, et al. ∙

research

∙ 09/26/2018

Towards Game-based Metrics for Computational Co-creativity

We propose the following question: what game-like interactive system wou...

2 Rodrigo Canaan, et al. ∙

research

∙ 03/20/2020

Computing the proportional veto core

Moulin (1981) has argued in favour of electing an alternative by giving ...

0 Egor Ianovski, et al. ∙

research

∙ 06/28/2021

On the Connection between Individual Scaled Vickrey Payments and the Egalitarian Allocation

The Egalitarian Allocation (EA) is a well-known profit sharing method fo...

0 N. Gräf, et al. ∙

research

∙ 06/28/2022

Weighted Average-convexity and Cooperative Games

We generalize the notion of convexity and average-convexity to the notio...

0 Alexandre Skoda, et al. ∙