Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"selfish routing"”.
-
Dynamic selfish routing
This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In the Wardrop model, which forms the basis of our dynamic population model, each of an infinite number of agents injects an infinitesimal amount of flow into a network, which in turn induces latency on the …
-
Approximation algorithms for distributed and selfish agents
Many real-world systems involve distributed and selfish agents who optimize their own objective function. In these systems, we need to design efficient mechanisms so that system-wide objective is optimized despite agents acting in their own self interest. In this thesis, we develop approximation …
-
Information and Incentives in Online Platforms
… for online platforms in three settings: traffic routing, network games, and competition between streaming platforms. In the first part of this thesis, Chapters 2 and 3, we study game play in routing and network games, where it is reasonable to assume agents do not originally know their payoff …
-
Information, Learning and Incentive Design for Urban Transportation Networks
… information platforms on travelers’ selfish routing decisions, and the resulting network congestion. We compare the value of information provided by multiple platforms to their users, and capture the key trade-off between the gain from information about uncertain network state and the …
-
Aspects of Wardrop equilibria
… network traffic. Network users may behave selfishly according to their private interest without regard to the overall system performance. Such highly complex environments prompted a paradigm shift in computer science. Whereas traditional concepts are designed for stand-alone machines and …