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 12 of 12 for “"Selfish Routing"”.

  1. Repeated Selfish Routing with Incomplete Information

    <p>Selfish routing is frequently discussed. The general framework of a system of non-cooperative users can be used to model many different optimization problems such as network routing, traffic or transportation problems.</p> <p>It is well known that the Wardrop user equilibria (i.e. the user optima) …

    mcmaster Repository record for Repeated Selfish Routing with Incomplete Information (opens in a new tab)

  2. Selfish Routing in Parallel Batch and Single Server Queues

    … the system operating under both probabilistic routing and state-dependent routing.• Probabilistic routing: When the system is operating under probabilistic routing, the users are given only knowledge of the system parameters. In this thesis, we show that user equilibria can be found by …

    auckland-ms Repository record for Selfish Routing in Parallel Batch and Single Server Queues (opens in a new tab)

  3. Using Reputation in Repeated Selfish Routing with Incomplete Information

    … as an instigator of beneficial user behavior in selfish routing and when the network users rely on the network coordinator for information about the network. Instead of using tolls or artificial delays, the network coordinator takes advantage of the users' insufficient data, in order to …

    mcmaster Repository record for Using Reputation in Repeated Selfish Routing with Incomplete Information (opens in a new tab)

  4. Game Theoretical Analysis for Selfish Routing with Oblivious Users

    We extend the original selfish routing setting by introducing users who are oblivious to congestion. Selfish routing captures only the behavior of selfish users, who choose the cheapest route based on the current traffic congestion without caring about the effects of their routing on their fellow …

    mcmaster Repository record for Game Theoretical Analysis for Selfish Routing with Oblivious Users (opens in a new tab)

  5. Trust-Aware Algorithms for Stackelberg Ground Vehicle Routing

    … network travel times, largely resulting from the routing decisions of individual vehicles. To address this challenge, this work leverages a Stackelberg game framework to model the interaction between a vehicle agent and a routing authority as a leader–follower game, in which the routing authority …

    must-thes Repository record for Trust-Aware Algorithms for Stackelberg Ground Vehicle Routing (opens in a new tab)

  6. User Equilibria in Systems of Parallel Processor Sharing Queues

    … a system of processor sharing queues under selfish routing, where the users choice of queue depends on their expected waiting times in each queue - in the simplest case they will seek just to minimize their expected waiting time. We assume that users have full knowledge of the state of the …

    auckland-ms Repository record for User Equilibria in Systems of Parallel Processor Sharing Queues (opens in a new tab)

  7. Paradigm and paradox in power networks

    … networks, the phenomenon results from selfish routing. In power systems, an analogous increase in congestion can arise as a consequence of Kirchhoff's laws, suggesting opportunities to optimize grid topology. The thesis starts with the discussion of Braess-like congestion phenomena in …

    bu Repository record for Paradigm and paradox in power networks (opens in a new tab)

  8. Multi-objective network design: Road capacity expansion and multi-modal recharge facility location

    … rather than system-wide performance. Such selfish routing strategies must be considered within the network design process to ensure that the planning decision has the expected impact. The objective of this thesis is to investigate the multi-objective NDP, aiming to address the …

    unsw Repository record for Multi-objective network design: Road capacity expansion and multi-modal recharge facility location (opens in a new tab)

  9. Δρομολόγηση και ανάθεση μήκους κύματος σε οπτικά δίκτυα

    We study models for routing and wavelength assignment in optical networks, aiming at showing properties of these models that must be taken into consideration when optical networks are deployed in practice. More specifically, we propose approximation algorithms for maximizing the number of satisfied …

    greece Repository record for Δρομολόγηση και ανάθεση μήκους κύματος σε οπτικά δίκτυα (opens in a new tab)

  10. Design and Analysis of Mobility Permit-based Traffic Management Schemes

    … of users such as cooperative versus selfish routing behaviors, human-associated factors (e.g., level of uncertainty) and interactions due to a shared infrastructure setting. Path-free mathematical programming models are formulated, obviating computationally intractable path …

    waterloo Repository record for Design and Analysis of Mobility Permit-based Traffic Management Schemes (opens in a new tab)