Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(STACKELBERG GAMES). Showing records 1 – 14 of 14 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Penn State University

1. Meimand Kermani, Amir Hossein. DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS.

Degree: 2013, Penn State University

 Recently, Stackelberg games have been employed by many economists who use game theory concepts to solve dynamic competitive service sector problems such as dynamic pricing,… (more)

Subjects/Keywords: DYNAMIC GAMES; STACKELBERG GAMES; DIFFERENTIAL GAMES; DYNAMIC PRICING; PRODUCTION PLANNING NETWORK DESIGN; LOGISTICS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Meimand Kermani, A. H. (2013). DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/18978

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Meimand Kermani, Amir Hossein. “DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS.” 2013. Thesis, Penn State University. Accessed December 03, 2020. https://submit-etda.libraries.psu.edu/catalog/18978.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Meimand Kermani, Amir Hossein. “DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS.” 2013. Web. 03 Dec 2020.

Vancouver:

Meimand Kermani AH. DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS. [Internet] [Thesis]. Penn State University; 2013. [cited 2020 Dec 03]. Available from: https://submit-etda.libraries.psu.edu/catalog/18978.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Meimand Kermani AH. DIFFERENTIAL STACKELBERG GAMES AND THEIR APPLICATION TO DYNAMIC PRICING, PRODUCTION PLANNING NETWORK DESIGN, AND LOGISTICS. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/18978

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

2. Wiesman, R. (author). Dynamic reverse Stackelberg games in infrastructure maintenance contract design.

Degree: 2017, Delft University of Technology

Infrastructure managers outsource maintenance activities to maintenance service contractors. This gives rise to misalignment between a contractor's short-term objectives and an infrastructure manager's long-term objectives.… (more)

Subjects/Keywords: maintenance outsourcing; infrastructure maintenance; dynamic reverse Stackelberg games; game theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wiesman, R. (. (2017). Dynamic reverse Stackelberg games in infrastructure maintenance contract design. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6904f1e6-e2b6-4e1d-a4ee-f255c02b65fb

Chicago Manual of Style (16th Edition):

Wiesman, R (author). “Dynamic reverse Stackelberg games in infrastructure maintenance contract design.” 2017. Masters Thesis, Delft University of Technology. Accessed December 03, 2020. http://resolver.tudelft.nl/uuid:6904f1e6-e2b6-4e1d-a4ee-f255c02b65fb.

MLA Handbook (7th Edition):

Wiesman, R (author). “Dynamic reverse Stackelberg games in infrastructure maintenance contract design.” 2017. Web. 03 Dec 2020.

Vancouver:

Wiesman R(. Dynamic reverse Stackelberg games in infrastructure maintenance contract design. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2020 Dec 03]. Available from: http://resolver.tudelft.nl/uuid:6904f1e6-e2b6-4e1d-a4ee-f255c02b65fb.

Council of Science Editors:

Wiesman R(. Dynamic reverse Stackelberg games in infrastructure maintenance contract design. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:6904f1e6-e2b6-4e1d-a4ee-f255c02b65fb

3. Könönen, Ville. Multiagent Reinforcement Learning in Markov Games: Asymmetric and Symmetric Approaches.

Degree: 2004, Helsinki University of Technology

Modern computing systems are distributed, large, and heterogeneous. Computers, other information processing devices and humans are very tightly connected with each other and therefore it… (more)

Subjects/Keywords: Markov games; reinforcement learning; Nash equilibrium; Stackelberg equilibrium; value function approximation; policy gradient

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Könönen, V. (2004). Multiagent Reinforcement Learning in Markov Games: Asymmetric and Symmetric Approaches. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2004/isbn9512273594/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Könönen, Ville. “Multiagent Reinforcement Learning in Markov Games: Asymmetric and Symmetric Approaches.” 2004. Thesis, Helsinki University of Technology. Accessed December 03, 2020. http://lib.tkk.fi/Diss/2004/isbn9512273594/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Könönen, Ville. “Multiagent Reinforcement Learning in Markov Games: Asymmetric and Symmetric Approaches.” 2004. Web. 03 Dec 2020.

Vancouver:

Könönen V. Multiagent Reinforcement Learning in Markov Games: Asymmetric and Symmetric Approaches. [Internet] [Thesis]. Helsinki University of Technology; 2004. [cited 2020 Dec 03]. Available from: http://lib.tkk.fi/Diss/2004/isbn9512273594/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Könönen V. Multiagent Reinforcement Learning in Markov Games: Asymmetric and Symmetric Approaches. [Thesis]. Helsinki University of Technology; 2004. Available from: http://lib.tkk.fi/Diss/2004/isbn9512273594/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of KwaZulu-Natal

4. Joseph, Kristina. Open-loop nash and stackelberg equilibrium for non-cooperative differential games with pure state constraints.

Degree: 2017, University of KwaZulu-Natal

 This dissertation deals with the study of non-cooperative di erential games with pure state constraints. We propose a rst order optimality result for the open-loop… (more)

Subjects/Keywords: Theses - Mathematics and Computer Science Education.; Stackelberg Equilibrium.; Nash Equilibrium.; Differential Games.; N-player differential games.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Joseph, K. (2017). Open-loop nash and stackelberg equilibrium for non-cooperative differential games with pure state constraints. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/15307

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Joseph, Kristina. “Open-loop nash and stackelberg equilibrium for non-cooperative differential games with pure state constraints.” 2017. Thesis, University of KwaZulu-Natal. Accessed December 03, 2020. http://hdl.handle.net/10413/15307.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Joseph, Kristina. “Open-loop nash and stackelberg equilibrium for non-cooperative differential games with pure state constraints.” 2017. Web. 03 Dec 2020.

Vancouver:

Joseph K. Open-loop nash and stackelberg equilibrium for non-cooperative differential games with pure state constraints. [Internet] [Thesis]. University of KwaZulu-Natal; 2017. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10413/15307.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Joseph K. Open-loop nash and stackelberg equilibrium for non-cooperative differential games with pure state constraints. [Thesis]. University of KwaZulu-Natal; 2017. Available from: http://hdl.handle.net/10413/15307

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

5. Pereira, Sahil. Stackelberg Multi-Agent Reinforcement Learning for Hierarchical Environments.

Degree: 2020, University of Waterloo

 This thesis explores the application of multi-agent reinforcement learning in domains containing asymmetries between agents, caused by differences in information and position, resulting in a… (more)

Subjects/Keywords: reinforcement learning; multi-agent; stackelberg model; hierarchical environments; game theory; machine learning; continuous space; policy gradient; markov games; actor critic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pereira, S. (2020). Stackelberg Multi-Agent Reinforcement Learning for Hierarchical Environments. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15851

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pereira, Sahil. “Stackelberg Multi-Agent Reinforcement Learning for Hierarchical Environments.” 2020. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/15851.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pereira, Sahil. “Stackelberg Multi-Agent Reinforcement Learning for Hierarchical Environments.” 2020. Web. 03 Dec 2020.

Vancouver:

Pereira S. Stackelberg Multi-Agent Reinforcement Learning for Hierarchical Environments. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/15851.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pereira S. Stackelberg Multi-Agent Reinforcement Learning for Hierarchical Environments. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15851

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of South Florida

6. Fabregas, Aldo D. Location and Capacity Modeling of Network Interchanges.

Degree: 2013, University of South Florida

 Network design decisions, especially those pertaining to urban infrastructure, are made by a central authority or network leader, and taking into consideration the network users… (more)

Subjects/Keywords: bi-level programming; network design problem; Stackelberg games; traffic equilibrium; transportation planning; Operational Research; Statistics and Probability; Urban Studies and Planning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fabregas, A. D. (2013). Location and Capacity Modeling of Network Interchanges. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/4318

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fabregas, Aldo D. “Location and Capacity Modeling of Network Interchanges.” 2013. Thesis, University of South Florida. Accessed December 03, 2020. https://scholarcommons.usf.edu/etd/4318.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fabregas, Aldo D. “Location and Capacity Modeling of Network Interchanges.” 2013. Web. 03 Dec 2020.

Vancouver:

Fabregas AD. Location and Capacity Modeling of Network Interchanges. [Internet] [Thesis]. University of South Florida; 2013. [cited 2020 Dec 03]. Available from: https://scholarcommons.usf.edu/etd/4318.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fabregas AD. Location and Capacity Modeling of Network Interchanges. [Thesis]. University of South Florida; 2013. Available from: https://scholarcommons.usf.edu/etd/4318

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. Letchford, Joshua. Computational Aspects of Stackelberg Games .

Degree: 2013, Duke University

  Game theory involves the study of how self-interested agents interact in various settings. Perhaps the best-known game theoretic solution concept is that of Nash… (more)

Subjects/Keywords: Computer science; Game Theory; Stackelberg games

…force behind the recent research into the computational aspects of 1 Stackelberg games is a… …Stackelberg games Recall that in a Stackelberg equilibrium, one of the players (the leader)… …Stackelberg games in Chapter 2. Under the assumption that the targets are completely independent… …examine computational aspects of computing Stackelberg equilibrium in three types of games… …computation of correlated equilibria of stochastic games by studying the computation of Stackelberg… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Letchford, J. (2013). Computational Aspects of Stackelberg Games . (Thesis). Duke University. Retrieved from http://hdl.handle.net/10161/7218

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Letchford, Joshua. “Computational Aspects of Stackelberg Games .” 2013. Thesis, Duke University. Accessed December 03, 2020. http://hdl.handle.net/10161/7218.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Letchford, Joshua. “Computational Aspects of Stackelberg Games .” 2013. Web. 03 Dec 2020.

Vancouver:

Letchford J. Computational Aspects of Stackelberg Games . [Internet] [Thesis]. Duke University; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10161/7218.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Letchford J. Computational Aspects of Stackelberg Games . [Thesis]. Duke University; 2013. Available from: http://hdl.handle.net/10161/7218

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Stankova, K. On Stackelberg and Inverse Stackelberg Games & Their Applications in the Optimal Toll Design Problem, the Energy Markets Liberalization Problem, and in the Theory of Incentives.

Degree: 2009, Next Generation Infrastructures Foundation

This thesis studies the so-called inverse Stackelberg games, that are new in the world of game theory, their properties, and their applications in the optimal toll design problem, the energy markets liberalization problem, and in the theory of incentives. Advisors/Committee Members: Olsder, G.J., Bliemer, M.C.J..

Subjects/Keywords: game theory; Stackelberg games; inverse Stackelberg games; optimal toll design problem; theory of incentives; energy markets liberalization problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Stankova, K. (2009). On Stackelberg and Inverse Stackelberg Games & Their Applications in the Optimal Toll Design Problem, the Energy Markets Liberalization Problem, and in the Theory of Incentives. (Doctoral Dissertation). Next Generation Infrastructures Foundation. Retrieved from http://resolver.tudelft.nl/uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; urn:NBN:nl:ui:24-uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; urn:NBN:nl:ui:24-uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; http://resolver.tudelft.nl/uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024

Chicago Manual of Style (16th Edition):

Stankova, K. “On Stackelberg and Inverse Stackelberg Games & Their Applications in the Optimal Toll Design Problem, the Energy Markets Liberalization Problem, and in the Theory of Incentives.” 2009. Doctoral Dissertation, Next Generation Infrastructures Foundation. Accessed December 03, 2020. http://resolver.tudelft.nl/uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; urn:NBN:nl:ui:24-uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; urn:NBN:nl:ui:24-uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; http://resolver.tudelft.nl/uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024.

MLA Handbook (7th Edition):

Stankova, K. “On Stackelberg and Inverse Stackelberg Games & Their Applications in the Optimal Toll Design Problem, the Energy Markets Liberalization Problem, and in the Theory of Incentives.” 2009. Web. 03 Dec 2020.

Vancouver:

Stankova K. On Stackelberg and Inverse Stackelberg Games & Their Applications in the Optimal Toll Design Problem, the Energy Markets Liberalization Problem, and in the Theory of Incentives. [Internet] [Doctoral dissertation]. Next Generation Infrastructures Foundation; 2009. [cited 2020 Dec 03]. Available from: http://resolver.tudelft.nl/uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; urn:NBN:nl:ui:24-uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; urn:NBN:nl:ui:24-uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; http://resolver.tudelft.nl/uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024.

Council of Science Editors:

Stankova K. On Stackelberg and Inverse Stackelberg Games & Their Applications in the Optimal Toll Design Problem, the Energy Markets Liberalization Problem, and in the Theory of Incentives. [Doctoral Dissertation]. Next Generation Infrastructures Foundation; 2009. Available from: http://resolver.tudelft.nl/uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; urn:NBN:nl:ui:24-uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; urn:NBN:nl:ui:24-uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024 ; http://resolver.tudelft.nl/uuid:8a7342eb-cf40-459b-8adc-fa4806f4e024


Delft University of Technology

9. Su, Z. Maintenance optimization for railway infrastructure networks.

Degree: 2018, Delft University of Technology

 Maintenance is crucial for the proper functioning and lifetime extension of a railway infrastructure network, which is composed of various infrastructures with different functions. In… (more)

Subjects/Keywords: maintenance optimization; railway infrastructures; travelling salesman problem; model predictive control; reverse Stackelberg games

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Su, Z. (2018). Maintenance optimization for railway infrastructure networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; urn:NBN:nl:ui:24-uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; 04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; 10.4233/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; urn:isbn:978-90-5584-238-4 ; urn:NBN:nl:ui:24-uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; http://resolver.tudelft.nl/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a

Chicago Manual of Style (16th Edition):

Su, Z. “Maintenance optimization for railway infrastructure networks.” 2018. Doctoral Dissertation, Delft University of Technology. Accessed December 03, 2020. http://resolver.tudelft.nl/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; urn:NBN:nl:ui:24-uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; 04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; 10.4233/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; urn:isbn:978-90-5584-238-4 ; urn:NBN:nl:ui:24-uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; http://resolver.tudelft.nl/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a.

MLA Handbook (7th Edition):

Su, Z. “Maintenance optimization for railway infrastructure networks.” 2018. Web. 03 Dec 2020.

Vancouver:

Su Z. Maintenance optimization for railway infrastructure networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2018. [cited 2020 Dec 03]. Available from: http://resolver.tudelft.nl/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; urn:NBN:nl:ui:24-uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; 04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; 10.4233/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; urn:isbn:978-90-5584-238-4 ; urn:NBN:nl:ui:24-uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; http://resolver.tudelft.nl/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a.

Council of Science Editors:

Su Z. Maintenance optimization for railway infrastructure networks. [Doctoral Dissertation]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; urn:NBN:nl:ui:24-uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; 04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; 10.4233/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; urn:isbn:978-90-5584-238-4 ; urn:NBN:nl:ui:24-uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a ; http://resolver.tudelft.nl/uuid:04ccfed8-ab44-43c6-8223-3da5e5bb7c4a

10. Korzhyk, Dmytro. Security Games: Solution Concepts and Algorithms .

Degree: 2013, Duke University

  Algorithms for finding game-theoretic solutions are now used in several real-world security applications. Many of these applications are based on different but related game-theoretical… (more)

Subjects/Keywords: Computer science; Economics; game theory; nash equilibrium; security games; stackelberg strategy

…the single-LP method for computing a Stackelberg strategy in GAMUT games… …compute a Stackelberg strategy in security games. . 47 An example in which the LP solution is… …issues in this thesis. It is not clear how best to extend the Stackelberg model to games with… …the Stackelberg model for games with two players and can be naturally extended to games with… …21 3 Solving Stackelberg Games with Uncertain Observability Playing a Stackelberg… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Korzhyk, D. (2013). Security Games: Solution Concepts and Algorithms . (Thesis). Duke University. Retrieved from http://hdl.handle.net/10161/8020

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Korzhyk, Dmytro. “Security Games: Solution Concepts and Algorithms .” 2013. Thesis, Duke University. Accessed December 03, 2020. http://hdl.handle.net/10161/8020.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Korzhyk, Dmytro. “Security Games: Solution Concepts and Algorithms .” 2013. Web. 03 Dec 2020.

Vancouver:

Korzhyk D. Security Games: Solution Concepts and Algorithms . [Internet] [Thesis]. Duke University; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10161/8020.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Korzhyk D. Security Games: Solution Concepts and Algorithms . [Thesis]. Duke University; 2013. Available from: http://hdl.handle.net/10161/8020

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

11. Nehme, Michael Victor. Two-person games for stochastic network interdiction : models, methods, and complexities.

Degree: PhD, Operations Research and Industrial Engineering, 2009, University of Texas – Austin

 We describe a stochastic network interdiction problem in which an interdictor, subject to limited resources, installs radiation detectors at border checkpoints in a transportation network… (more)

Subjects/Keywords: Stochastic network interdiction problem; Stackelberg game; Cournot game; Smugglers; Smuggling; Radiation detectors; Border checkpoints; Two-person games; Mathematical models

…Person Games for Stochastic Network Interdiction: Models, Methods, and Complexities… …consider three variants of the problem. The first is a Stackelberg game which assumes that the… …to the smuggler. vii In the Stackelberg setting, the problem is NP-complete even if the… …1.2 Two-Person Zero-Sum Cournot Games . . . 1.3 The Weighted Majority Algorithm… …Person Zero-Sum Games for Network Interdiction 77 Introduction… 

Page 1 Page 2 Page 3 Page 4 Page 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nehme, M. V. (2009). Two-person games for stochastic network interdiction : models, methods, and complexities. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/7512

Chicago Manual of Style (16th Edition):

Nehme, Michael Victor. “Two-person games for stochastic network interdiction : models, methods, and complexities.” 2009. Doctoral Dissertation, University of Texas – Austin. Accessed December 03, 2020. http://hdl.handle.net/2152/7512.

MLA Handbook (7th Edition):

Nehme, Michael Victor. “Two-person games for stochastic network interdiction : models, methods, and complexities.” 2009. Web. 03 Dec 2020.

Vancouver:

Nehme MV. Two-person games for stochastic network interdiction : models, methods, and complexities. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2009. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2152/7512.

Council of Science Editors:

Nehme MV. Two-person games for stochastic network interdiction : models, methods, and complexities. [Doctoral Dissertation]. University of Texas – Austin; 2009. Available from: http://hdl.handle.net/2152/7512

12. Chen, Hong. Individual Mobile Communication Services and Tariffs.

Degree: 2008, Erasmus Research Institute of Management

 textabstractIndividual services and tariffs existed briefly in the beginning of telecommunications history 150 years ago but faded away over time. Service provisioning evolved into the… (more)

Subjects/Keywords: Stackelberg games; community-based individual services and tariffs; computational game theory; extreme theory applications; individual services and tariffs; mass customization; negotiation; service configuration; supplier risk; wireless and mobile communication services

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, H. (2008). Individual Mobile Communication Services and Tariffs. (Doctoral Dissertation). Erasmus Research Institute of Management. Retrieved from http://hdl.handle.net/1765/11141

Chicago Manual of Style (16th Edition):

Chen, Hong. “Individual Mobile Communication Services and Tariffs.” 2008. Doctoral Dissertation, Erasmus Research Institute of Management. Accessed December 03, 2020. http://hdl.handle.net/1765/11141.

MLA Handbook (7th Edition):

Chen, Hong. “Individual Mobile Communication Services and Tariffs.” 2008. Web. 03 Dec 2020.

Vancouver:

Chen H. Individual Mobile Communication Services and Tariffs. [Internet] [Doctoral dissertation]. Erasmus Research Institute of Management; 2008. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1765/11141.

Council of Science Editors:

Chen H. Individual Mobile Communication Services and Tariffs. [Doctoral Dissertation]. Erasmus Research Institute of Management; 2008. Available from: http://hdl.handle.net/1765/11141


Université de Montréal

13. Lounnas, Djallil. La sécurité collective dans l’unipolarité : la crise nucléaire iranienne.

Degree: 2010, Université de Montréal

Subjects/Keywords: Sécurité collective; Coopération conflictuelle; Leadership de Stackelberg; Non-prolifération; Coûts de la coopération; Stratégie de la réciprocité; Jeux à niveaux multiples; Sanctions internationales; Iran; Grandes puissances; Collective Security; Conflicting cooperation; Stackelberg model leadership; Non proliferation; Cooperation costs; Reciprocity strategy; Multilevel games; International sanctions; Iran; Major powers; Political Science - International Law and Relations / Science politique - Droit et relations internationales (UMI : 0616)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lounnas, D. (2010). La sécurité collective dans l’unipolarité : la crise nucléaire iranienne. (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/4513

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lounnas, Djallil. “La sécurité collective dans l’unipolarité : la crise nucléaire iranienne.” 2010. Thesis, Université de Montréal. Accessed December 03, 2020. http://hdl.handle.net/1866/4513.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lounnas, Djallil. “La sécurité collective dans l’unipolarité : la crise nucléaire iranienne.” 2010. Web. 03 Dec 2020.

Vancouver:

Lounnas D. La sécurité collective dans l’unipolarité : la crise nucléaire iranienne. [Internet] [Thesis]. Université de Montréal; 2010. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1866/4513.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lounnas D. La sécurité collective dans l’unipolarité : la crise nucléaire iranienne. [Thesis]. Université de Montréal; 2010. Available from: http://hdl.handle.net/1866/4513

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Khanafer, Ali. Information spread in networks: games, optimal control, and stabilization.

Degree: PhD, 1200, 2015, University of Illinois – Urbana-Champaign

 This thesis focuses on designing efficient mechanisms for controlling information spread in networks. We consider two models for information spread. The first one is the… (more)

Subjects/Keywords: Game Theory; Optimal Control; Stackelberg Games; Distributed Averaging; Epidemics; Stabilization; Positive Systems; Lyapunov Theory; Pontryagin's Maximum Principle; Potential Theory; Network Analysis and Control; Network Games; Diffusion; Security; Superivsory Control; Switched Systems; Differential Games; Graph Theory; Limited Control; Sparse Resource Allocation; Vaccination; Distributed Control

…propose zero-sum games to construct controllers suitable for competitive dynamic environments… …that 9 is motivated by theory of noncooperative games and show that this model subsumes… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Khanafer, A. (2015). Information spread in networks: games, optimal control, and stabilization. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/72769

Chicago Manual of Style (16th Edition):

Khanafer, Ali. “Information spread in networks: games, optimal control, and stabilization.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 03, 2020. http://hdl.handle.net/2142/72769.

MLA Handbook (7th Edition):

Khanafer, Ali. “Information spread in networks: games, optimal control, and stabilization.” 2015. Web. 03 Dec 2020.

Vancouver:

Khanafer A. Information spread in networks: games, optimal control, and stabilization. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2142/72769.

Council of Science Editors:

Khanafer A. Information spread in networks: games, optimal control, and stabilization. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/72769

.