> Top >> Invited Talks
Edith Elkind (University of Oxford, UK)"Group Fairness: From Multiwinner Voting to Participatory Budgeting"
Abstract
Many cities around the world allocate a part of their budget based on residents’ votes, following a process known as participatory budgeting. It is important to understand which outcomes of this process should be viewed as fair, and whether fair outcomes could be computed efficiently. We summarise recent progress on this topic. We first focus on a special case of participatory budgeting where all candidate projects have the same cost (known as multiwinner voting), formulate progressively more demanding notions of fairness for this setting, and identify efficiently computable voting rules that satisfy them. We then discuss the challenges of extending these ideas to the general model.
Biography
Edith Elkind is a Professor of Computer Science at the University of Oxford and the Theme lead on Game Theory at the Alan Turing Institute. She obtained her PhD from Princeton in 2005, and has worked in the UK, Israel, and Singapore before joining Oxford in 2013. She works in algorithmic game theory, with a focus on algorithms for collective decision making and coalition formation. Edith is an ELLIS Fellow, a EurAI Fellow, and a recipient of SIGAI Autonomous Agents Research Award (2023). She has served as a program chair of COMSOC, WINE, AAMAS, ACM EC, and IJCAI, and is a member of AAAI executive council, SCW council, and IJCAI board of trustees.
Seok-Hee Hong (University of Sydney, Australia)"Faithful Graph Drawing"
Abstract
Graph drawing aims to compute good geometric representations of graphs in two or three dimensions. It has wide applications in network visualisation, such as social networks and biological networks, arising from many other disciplines.
This talk will review fundamental theoretical results as well as some recent advances, including symmetric graph drawing, generalisation of the Tutte barycenter theorem, Steinitz theorem, and Fary's theorem, and the so-called "beyond planar" graphs such as k-planar graphs.
I will conclude my talk with recent progress in visualisation of big complex graphs, including sublinear algorithms and faithful graph visualisation.
Biography
Seok-Hee Hong is a professor at the University of Sydney. She was ARC (Australian Research Council) Future Fellow, Humboldt Fellow, ARC Research Fellow, Project leader of VALACON (Visualisation and Analysis of Large and Complex Networks) project at NICTA (National ICT Australia), Postdoctoral fellow at the University of Sydney and KOSEF (KOrea Science and Engineering Foundation) postdoc fellow at the University of Newcastle.
Her research interests include Graph Drawing, Algorithms, Information Visualisation and Visual Analytics. She serves as a Steering Committee member of ISAAC (International Symposium on Algorithms and Computations) and IEEE PacificVis (International Symposium on Pacific Visualisation), and an editor of JGAA (Journal of Graph Algorithms and Applications).