mpla.math.uoa.gr
Font size: Αα Αα Αα hide gadgets
You are here: Defenses » November 2017 » Andreas Mantis Anonymously browsing from 54.92.201.232 at 10:28:37, 15-12-2017. login
download defense details: { pdf }

MSc thesis defense presentation

Andreas Mantis defends his MSc thesis

Date: Wednesday, 22 Nov 2017
Time: 15:00
Location: School of Electrical and Computer Engineering (old buildings), 1.1.31
Thesis title: Change averse equilibria in congestion games
Committee:

Thesis abstract

We introduce a new model in Congestion Games, where players choose their strategy according to the new cost they incur, as well as the difference between their current state and the new state they are considering. The latter part of the decision-making process is based on the assumption that players who are considering a significant change are less prone to take it, than they do on a similar choice. This model has analogies with ϵ−approximate equilibria. We can easily see that this new model provides a richer set of equilibria than approximate equilibria. Christodoulou et al. prove that as far as Linear Congestion Games are concerned, we have good bounds on the Price of Anarchy. We prove that similar results are true in our case. We also prove that players do actually converge on such an equilibrium and relatively quickly.

Reporter

Page updates

No recent updates.

Feeds RSS and Atom feeds

posts
all posts RSS
news RSS
announcements RSS
website news RSS
events
all events RSS
defenses RSS
exams RSS
seminars RSS
graduations RSS
Web standards: XHTML1.0, CSS3.
© 1996 – 2017 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.