Πολυπλοκότητα ισορροπιών σε βεβαρυμένα παίγνια

Μουζάκης, Νικόλαος; Mouzakis, Nikolaos

dc.contributor.author	Μουζάκης, Νικόλαος	el
dc.contributor.author	Mouzakis, Nikolaos	en
dc.date.accessioned	2020-05-13T13:22:58Z
dc.date.available	2020-05-13T13:22:58Z
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/50546
dc.identifier.uri	http://dx.doi.org/10.26240/heal.ntua.18244
dc.rights	Default License
dc.subject	Πολυπλοκότητα αναζήτησης	el
dc.subject	Παίγνια συμφόρησης	el
dc.subject	Τοπική αναζήτηση	el
dc.subject	Μέγιστη τομή	el
dc.subject	Αμιγής ισορροπία	el
dc.subject	Search complexity	en
dc.subject	PLS	en
dc.subject	Congestion games	en
dc.subject	MaxCut	en
dc.subject	Local search	en
dc.title	Πολυπλοκότητα ισορροπιών σε βεβαρυμένα παίγνια	el
dc.title	Complexity of equilibria in weighted games	en
heal.type	bachelorThesis
heal.classification	Θεωρητική επιστήμη υπολογιστών	el
heal.language	el
heal.language	en
heal.access	campus
heal.recordProvider	ntua	el
heal.publicationDate	2019-11-06
heal.abstract	In many settings we are interested in problems that, despite being hard to solve globally, admit some local optimization heuristic that can offer locally optimal solutions. The archetypal example of this class of problems is the MaxCut problem under the flip neighborhood, where we can incrementally improve the value of the cut by flipping nodes. However, it has been shown that calculating the result of this process a priori is at least as hard as solving any other local optimization problem, i.e. it is PLS-hard. In this thesis, we consider a variation of the above problem, named NodeMaxCut, inspired by the combinatorial structure of weighted congestion games, where the MaxCut graph is instead node-weighted rather than edge weighted. We show that, surpisingly, this problem is still PLS-hard despite its still simple structure, through an involved reduction from the canonical PLS problem CircuitFlip. Our reduction is based on and extends previous work on similar reductions. Secondly, we consider certain forms of weighted congestion games, namely series-parallel weighted congestion games with linear delay functions, as well as weighted multi-commodity congestion games with identity delay functions. The latter is obtained as an application of the PLS hardness of NodeMaxCut. Our work adds a new PLS-complete problem to the literature.	en
heal.advisorName	Φωτάκης, Δημήτρης	el
heal.committeeMemberName	Παγουρτζής, Άρης	el
heal.committeeMemberName	Φωτάκης, Δημήτρης	el
heal.committeeMemberName	Μαρκάκης, Ευάγγελος	el
heal.academicPublisher	Εθνικό Μετσόβιο Πολυτεχνείο. Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών. Τομέας Τεχνολογίας Πληροφορικής και Υπολογιστών. Εργαστήριο Λογικής και Επιστήμης Υπολογισμών	el
heal.academicPublisherID	ntua
heal.numberOfPages	76 σ.
heal.fullTextAvailability	false