Journal
MATHEMATICAL PROGRAMMING
Volume 183, Issue 1-2, Pages 555-581Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-020-01483-4
Keywords
Combinatorial Optimization; Algorithmic Game Theory; Matchings
Categories
Funding
- DIMACS/Simons Collaboration on Bridging Continuous and Discrete Optimization through NSF grant [CCF-1740425]
- Natural Sciences and Engineering Research Council of Canada (NSERC)
Ask authors/readers for more resources
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 (Math Programm, 83: 555-569, 1998).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
