• Login
    View Item 
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    On approximation algorithms and the cost of decentralization for problems in network restoration

    Author
    Sun, Hongtan
    View/Open
    180217_Sun_rpi_0185E_11103.pdf (551.3Kb)
    Other Contributors
    Sharkey, Thomas C.; Wallace, William A.; Mitchell, John E.; Anshelevich, Elliot;
    Date Issued
    2017-08
    Subject
    Decision sciences and engineering systems
    Degree
    PhD;
    Terms of Use
    This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.;
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/20.500.13015/2574
    Abstract
    In this dissertation project, we investigate approximation algorithms and the cost of decentralized decision-making arising from problems in post-disaster infrastructure network restoration. Problems arising both in single infrastructure network restoration and multi-infrastructure network restoration are investigated.; In the area of single infrastructure restoration, we investigate a fractional optimization problem arising in dispatching rules for Integrated Network Design and Scheduling (INDS) problems. We demonstrate the NP-hardness for the fractional optimization and provide tight approximation guarantees for the dispatching rules.; Despite the wide existence of interdependencies, post-disaster restoration efforts for interdependent multi-infrastructure systems are often made in a decentralized manner as each infrastructure sets their individual work schedule towards its own best performance. We examine Algorithmic Game Theory and develop Decentralized Interdependent Scheduling (DIS) framework to model these interactions between infrastructures and to quantify the impacts of decentralization using the price of anarchy (PoA) and the price of stability (PoS). Upper bounds for the PoA and the PoS are demonstrated to depend linearly on the sum of the processing times of the restoration tasks across the system. Mixed integer program constraints are formulated to characterize Nash equilibria and an incentive structure for Incomplete Information Simple External Dependency DIS Games (iSEDGs). In numerical experiments, the constraints are used to evaluate the PoA and the PoS for iSEDGs, their upper bounds and improved PoS under incentive structure. In many cases, the PoA and the PoS could be improved by incentivizing players with external fund.;
    Description
    August 2017; School of Engineering
    Department
    Dept. of Industrial and Systems Engineering;
    Publisher
    Rensselaer Polytechnic Institute, Troy, NY
    Relationships
    Rensselaer Theses and Dissertations Online Collection;
    Access
    Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.;
    Collections
    • RPI Theses Online (Complete)

    Browse

    All of DSpace@RPICommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2022  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV