Selected Publications

This paper defines a general class of cooperative games for which the nucleolus is efficiently computable. This class includes new members for which the complexity of computing their nucleolus was not previously known. We show that when the minimum excess coalition problem of a cooperative game can be formulated as a hypergraph dynamic program its nucleolus is efficiently computable. This gives a general technique for designing efficient algorithms for computing the nucleolus of a cooperative game. This technique is inspired by a recent result of Pashkovich (2018) on weighted voting games. However our technique significantly extends beyond the capabilities of previous work. We demonstrate this by applying it to give an algorithm for computing the nucleolus of b-matching games in polynomial time on graphs of bounded treewidth.
2020

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, circa Mathematics of Operations Research, 2003.
2018

Recent Publications

This paper defines a general class of cooperative games for which the nucleolus is efficiently computable. This class includes new …

We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. This resolves a …

In this thesis we provide two contributions to the study of structure in stable matching problems. The first contribution is a short …

In this paper we provide a short new proof for the integrality of Rothblum’s linear description of the convex hull of incidence vectors …

Contact

  • 226 345 7600
  • MC 5023B, University of Waterloo, Ontario, N2L 3G1, Canada
  • Friday 09:00 to 10:00
    Otherwise email to book an appointment