14/03/2024, 15:00 — 15:15 — Room P3.10, Mathematics Building Online
Diogo Poças, Instituto Superior Técnico
Equilibria computation in algorithmic game theory
Many problems in computer science inherently involve interactions between multiple self-interested agents. The behaviour of such systems can be rigorously modeled using tools from game theory. A concrete question is the problem of determining whether a given system has an equilibrium (a situation in which no agent benefits from changing her strategy) and how to find such an equilibrium. The topic of this dissertation proposal is the study of the computational complexity of decision and search problems regarding equilibria in certain families of games.
See also
15H00_DP.pdf
