Events

Title: Popular Matchings

Abstract:

We introduce a variant of the stable matching problem on a bipartite graph G = (A [ P;E)

Title: Deducing Kurdyka-Łojasiewicz exponent of optimization models

Abstract:

Kurdyka-Łojasiewicz (KL) exponent is an important quantity for determining the qualitative convergence behavior of many first-order methods.

Title: Spanning trees and electrical networks... and what about matroids?

Abstract:

The relevance of spanning trees to the theory of electrifcal networks goes all the way back to Kirchhoff in 1847.

Title: Popularity, Mixed Matchings, and Self-duality

Abstract:

This week we continue our discussion of popular matchings.

Title: Matching Games: From Bargaining to the Nucleolus

Abstract:

Cooperative matching games were first introduced in seminal work by Shapley and Shubik in their classic 1971 paper. In this talk, I will first review some of the key concepts and results in this area. I will then use these tools to (re-)derive several facts and algorithms for network generalizations of the famous Nash bargaining concept.

Title: Arborified zeta values and shuffles of rooted trees

_{*Please note room change}

Abstract:

Arborified zeta values are a generalisation to rooted trees of the usual multizeta values.

Title: The Parallel Postulate: a 2000-year controversy

Abstract:

Euclid's book The Elements was groundbreaking in its logical formulation of synthetic geometry, and it is profoundly influential to this day, as it is widely considered to be the most published non-religious book in human history.

Title: The Parallel Postulate: a 2000-year controversy

Abstract:

Euclid's book The Elements was groundbreaking in its logical formulation of synthetic geometry, and it is profoundly influential to this day, as it is widely considered to be the most published non-religious book in human history.

Title: Maximum Cardinality Popular Matchings

Abstract:

We have seen the algorithm by Abraham, Irving, Kavitha, and Mehlhorn which deals with finding popular matchings (can be easily modified to give maximum cardinality popular matchings) in bipartite graphs with one-sided preference lists.

Title: Finding perfect matchings in random regular graphs in linear expected time

Abstract:

In a seminal paper on finding large matchings in sparse random graphs, Karp and Sipser proposed two algorithms for this task. The second algorithm has been intensely studied, but due to technical difficulties, the first algorithm has received less attention. Empirical results suggest that the first algorithm is superior.