Am 15. April 2026 findet der nächste MIMA Vortrag statt. Dieses Mal redet Nesibe Ayhan, eine Doktorratsstudentin an der KF, über im Wellen und deren Ausbreitung im Ozean.

• Wann: Am 12. Mai, von 11:45 bis 12:45
• Wo: Im Seminarraum AE06 in der Steyrergasse 30
• Titel: Combinatorial optimisation: hard, easy, efficient, fair?

Abstract: Combinatorial optimization lies at the intersection of mathematical beauty and computational necessity.
At its core, it asks a simple question: how can we select the "best" subset or arrangement from a finite, yet astronomically large, set of possibilities? 

In classical models, we typically optimize a single aggregated objective, such as finding the shortest route for a delivery truck or themost economical way to connect a network.A central theme in this field is the distinction between problems that are computationally tractable and those that are computationally hard. While "easy" problems like Minimum Spanning Trees allow for fast, polynomial-time algorithms, "hard" problems like the travelling salesperson problem become exponentially difficult as they grow. A key area of our research involves identifying specific structural properties of the input that can render these hard problems tractable.

The mathematical definition of an "optimal" solution often shifts when we consider the individual subjects involved. A solution that is mathematically optimal for the group can create large discrepancies in utility for individuals, leading to outcomes that are perceived as undesirable or fundamentally unfair. The search for the "best" solution is expanded to include fairness as a vital second objective. We investigate how to incorporate various fairness measures, such as egalitarian equity or envy-freeness, without losing the computational tractability that makes a solution useful in practice.