Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
| Autor: | Jochen Könemann, Justin Toth, Kanstantsin Pashkovich |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
050101 languages & linguistics
Theoretical computer science Matching (graph theory) Efficient algorithm 05 social sciences 0202 electrical engineering electronic engineering information engineering Matching game 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences 02 engineering and technology Time complexity Mathematics |
| Zdroj: | Integer Programming and Combinatorial Optimization ISBN: 9783030179526 IPCO |
| DOI: | 10.1007/978-3-030-17953-3_31 |
| Popis: | 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 posed in [Faigle, Kern, Fekete, Hochstattler, Mathematical Programming, 1998]. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|