Dimitris Michailidis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dimitris Michailidis has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Sennay Ghebreab
University of Amsterdam, Amsterdam, Netherlands
5 shared publications - Fernando Pascoal Dos Santos
University of Amsterdam, Amsterdam, Netherlands
4 shared publications - Mayesha Tasnim
University of Amsterdam
2 shared publications - Aristotle Tympas
University of Athens
1 shared publication - Diederik M. Roijers
Artificial Intelligence Lab, Vrije Universiteit Brussel, Brussels, Belgium
1 shared publication - Imad Antoine Ibrahim
University of Twente
1 shared publication
Latest Publications
- Open Access
- 25 March 2026
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 85
Scalable Multi-Objective Reinforcement Learning with Fairness Guarantees using Lorenz Dominance
Multi-Objective Reinforcement Learning (MORL) aims to learn a set of policies that optimize trade-offs between multiple, often conflicting objectives. MORL is computationally more complex than single-objective RL, particularly as the number of objectives increases. Additionally, when objectives involve the preferences of agents or groups, incorporating fairness becomes both important and socially desirable. This paper introduces a principled algorithm that incorporates fairness into MORL while improving scalability to many-objective problems. We propose using Lorenz dominance to identify policies with equitable reward distributions and introduce λ-Lorenz dominance to enable flexible fairness preferences. We release a new, large-scale real-world transport planning environment and demonstrate that our method encourages the discovery of fair policies, showing improved scalability in two large cities (Xi’an and Amsterdam). Our methods outperform common multi-objective approaches, particularly in high-dimensional objective spaces.
- 25 March 2026
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 85
Open AccessScalable Multi-Objective Reinforcement Learning with Fairness Guarantees using Lorenz Dominance
Multi-Objective Reinforcement Learning (MORL) aims to learn a set of policies that optimize trade-offs between multiple, often conflicting objectives. MORL is computationally more complex than single-objective RL, particularly as the number of objectives increases. Additionally, when objectives involve the preferences of agents or groups, incorporating fairness becomes both important and socially desirable. This paper introduces a principled algorithm that incorporates fairness into MORL while improving scalability to many-objective problems. We propose using Lorenz dominance to identify policies with equitable reward distributions and introduce λ-Lorenz dominance to enable flexible fairness preferences. We release a new, large-scale real-world transport planning environment and demonstrate that our method encourages the discovery of fair policies, showing improved scalability in two large cities (Xi’an and Amsterdam). Our methods outperform common multi-objective approaches, particularly in high-dimensional objective spaces.
- Open Access
Inequality in Congestion Games with Learning Agents
Who benefits from expanding transport networks? While designed to improve mobility, such interventions can also create inequality. In this paper, we show that disparities arise not only from the structure of the network itself but also from differences in how commuters adapt to it. We model commuters as reinforcement learning agents who adapt their travel choices at different learning rates, reflecting unequal access to resources and information. To capture potential efficiency-fairness tradeoffs, we introduce the Price of Learning (PoL), a measure of inefficiency during learning. We analyze both a stylized network -- inspired in the well-known Braess's paradox, yet with two-source nodes -- and an abstraction of a real-world metro system (Amsterdam). Our simulations show that network expansions can simultaneously increase efficiency and amplify inequality, especially when faster learners disproportionately benefit from new routes before others adapt. These results highlight that transport policies must account not only for equilibrium outcomes but also for the heterogeneous ways commuters adapt, since both shape the balance between efficiency and fairness.
Open AccessInequality in Congestion Games with Learning Agents
Who benefits from expanding transport networks? While designed to improve mobility, such interventions can also create inequality. In this paper, we show that disparities arise not only from the structure of the network itself but also from differences in how commuters adapt to it. We model commuters as reinforcement learning agents who adapt their travel choices at different learning rates, reflecting unequal access to resources and information. To capture potential efficiency-fairness tradeoffs, we introduce the Price of Learning (PoL), a measure of inefficiency during learning. We analyze both a stylized network -- inspired in the well-known Braess's paradox, yet with two-source nodes -- and an abstraction of a real-world metro system (Amsterdam). Our simulations show that network expansions can simultaneously increase efficiency and amplify inequality, especially when faster learners disproportionately benefit from new routes before others adapt. These results highlight that transport policies must account not only for equilibrium outcomes but also for the heterogeneous ways commuters adapt, since both shape the balance between efficiency and fairness.
- Open Access
- 3 October 2024
- Published by Springer Nature
- p. 115-127
Enabling Inclusive Urban Transport Planning Through Civic Artificial Intelligence
We recommend enabling inclusive urban transport planning through civic artificial intelligence. To achieve this policy recommendation, we propose the following: (1) Encourage and provide resources for experimentation with new technologies that enable local community participation in urban transport planning; (2) Recognize the potential of Artificial Intelligence (AI) to assist in complex urban transport planning decisions; (3) Acknowledge that AI is embedded in society, instead of treating it as a neutral technology; and (4) Foster community engagement in transport planning and evaluation, via a Civic AI framework that directly integrates preferences and feedback into planning.
- 3 October 2024
- Published by Springer Nature
- p. 115-127
Open AccessEnabling Inclusive Urban Transport Planning Through Civic Artificial Intelligence
We recommend enabling inclusive urban transport planning through civic artificial intelligence. To achieve this policy recommendation, we propose the following: (1) Encourage and provide resources for experimentation with new technologies that enable local community participation in urban transport planning; (2) Recognize the potential of Artificial Intelligence (AI) to assist in complex urban transport planning decisions; (3) Acknowledge that AI is embedded in society, instead of treating it as a neutral technology; and (4) Foster community engagement in transport planning and evaluation, via a Civic AI framework that directly integrates preferences and feedback into planning.
- Open Access
- 20 May 2024
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 38 (1) , 1-22
Tackling school segregation with transportation network interventions: an agent-based modelling approach
We address the emerging challenge of school segregation within the context of free school choice systems. Households take into account both proximity and demographic composition when deciding on which schools to send their children to, potentially exacerbating residential segregation. This raises an important question: can we strategically intervene in transportation networks to enhance school access and mitigate segregation? In this paper, we propose a novel, network agent-based model to explore this question. Through simulations in both synthetic and real-world networks, we demonstrate that enhancing school accessibility via transportation network interventions can lead to a reduction in school segregation, under specific conditions. We introduce group-based network centrality measures and show that increasing the centrality of certain neighborhood nodes with respect to a transportation network can be an effective strategy for strategic interventions. We conduct experiments in two synthetic network environments, as well as in an environment based on real-world data from Amsterdam, the Netherlands. In both cases, we simulate a population of representative agents emulating real citizens’ schooling preferences, and we assume that agents belong to two different groups (e.g., based on migration background). We show that, under specific homophily regimes in the population, school segregation can be reduced by up to 35%. Our proposed framework provides the foundation to explore how citizens’ preferences, school capacity, and public transportation can shape patterns of urban segregation.
- 20 May 2024
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 38 (1) , 1-22
Open AccessTackling school segregation with transportation network interventions: an agent-based modelling approach
We address the emerging challenge of school segregation within the context of free school choice systems. Households take into account both proximity and demographic composition when deciding on which schools to send their children to, potentially exacerbating residential segregation. This raises an important question: can we strategically intervene in transportation networks to enhance school access and mitigate segregation? In this paper, we propose a novel, network agent-based model to explore this question. Through simulations in both synthetic and real-world networks, we demonstrate that enhancing school accessibility via transportation network interventions can lead to a reduction in school segregation, under specific conditions. We introduce group-based network centrality measures and show that increasing the centrality of certain neighborhood nodes with respect to a transportation network can be an effective strategy for strategic interventions. We conduct experiments in two synthetic network environments, as well as in an environment based on real-world data from Amsterdam, the Netherlands. In both cases, we simulate a population of representative agents emulating real citizens’ schooling preferences, and we assume that agents belong to two different groups (e.g., based on migration background). We show that, under specific homophily regimes in the population, school segregation can be reduced by up to 35%. Our proposed framework provides the foundation to explore how citizens’ preferences, school capacity, and public transportation can shape patterns of urban segregation.
- 30 March 2024
- Published by Springer Nature
- p. 217-227
Towards Reducing School Segregation by Intervening on Transportation Networks
- 30 March 2024
- Published by Springer Nature
- p. 217-227
Towards Reducing School Segregation by Intervening on Transportation Networks