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:(Congestion games). Showing records 1 – 11 of 11 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Παναγοπούλου, Παναγιώτα. Μελέτη δρομολογήσεων και συμφόρησης σε δίκτυα με βάση τη Θεωρία Παιγνίων.

Degree: 2005, University of Patras

 Στην παρούσα διπλωματικής εργασία εφαρμόζουμε τις αρχές της Θεωρίας Παιγνίων, και συγκεκριμένα τις έννοιες των Ισορροπιών Nash και των Παι­γνίου Συμφόρησης, ώστε να αναλύσουμε την… (more)

Subjects/Keywords: Θεωρία παιγνίων; Παίγνια συμφόρησης; Παίγνια δυναμικού; 519.82; Game theory; Congestion games; Potential games; Price of anarchy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Παναγοπούλου, . (2005). Μελέτη δρομολογήσεων και συμφόρησης σε δίκτυα με βάση τη Θεωρία Παιγνίων. (Masters Thesis). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/141

Chicago Manual of Style (16th Edition):

Παναγοπούλου, Παναγιώτα. “Μελέτη δρομολογήσεων και συμφόρησης σε δίκτυα με βάση τη Θεωρία Παιγνίων.” 2005. Masters Thesis, University of Patras. Accessed April 11, 2021. http://nemertes.lis.upatras.gr/jspui/handle/10889/141.

MLA Handbook (7th Edition):

Παναγοπούλου, Παναγιώτα. “Μελέτη δρομολογήσεων και συμφόρησης σε δίκτυα με βάση τη Θεωρία Παιγνίων.” 2005. Web. 11 Apr 2021.

Vancouver:

Παναγοπούλου . Μελέτη δρομολογήσεων και συμφόρησης σε δίκτυα με βάση τη Θεωρία Παιγνίων. [Internet] [Masters thesis]. University of Patras; 2005. [cited 2021 Apr 11]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/141.

Council of Science Editors:

Παναγοπούλου . Μελέτη δρομολογήσεων και συμφόρησης σε δίκτυα με βάση τη Θεωρία Παιγνίων. [Masters Thesis]. University of Patras; 2005. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/141

2. Χριστοδούλου, Γεώργιος. Παιγνιοθεωρητική μελέτη δικτύων.

Degree: 2006, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ)

Subjects/Keywords: Τιμή αναρχίας; Μηχανισμοί; Παίγνια συμφόρησης; Φιλαλήθεια; Θεωρία παιγνίων; Price of anarchy; Mechanisms; Congestion games; Truthfulness; Game theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Χριστοδούλου, . . (2006). Παιγνιοθεωρητική μελέτη δικτύων. (Thesis). National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Retrieved from http://hdl.handle.net/10442/hedi/22183

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):

Χριστοδούλου, Γεώργιος. “Παιγνιοθεωρητική μελέτη δικτύων.” 2006. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed April 11, 2021. http://hdl.handle.net/10442/hedi/22183.

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

MLA Handbook (7th Edition):

Χριστοδούλου, Γεώργιος. “Παιγνιοθεωρητική μελέτη δικτύων.” 2006. Web. 11 Apr 2021.

Vancouver:

Χριστοδούλου . Παιγνιοθεωρητική μελέτη δικτύων. [Internet] [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2006. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10442/hedi/22183.

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

Council of Science Editors:

Χριστοδούλου . Παιγνιοθεωρητική μελέτη δικτύων. [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2006. Available from: http://hdl.handle.net/10442/hedi/22183

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

3. CHEN ENXIAN. DYNAMIC GAMES AND GAMES WITH MANY PLAYERS.

Degree: 2020, National University of Singapore

Subjects/Keywords: large games; dynamic games; congestion games; robust perfect equilibrium; equilibrium refinement; no-mixing property

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

ENXIAN, C. (2020). DYNAMIC GAMES AND GAMES WITH MANY PLAYERS. (Thesis). National University of Singapore. Retrieved from https://scholarbank.nus.edu.sg/handle/10635/186960

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):

ENXIAN, CHEN. “DYNAMIC GAMES AND GAMES WITH MANY PLAYERS.” 2020. Thesis, National University of Singapore. Accessed April 11, 2021. https://scholarbank.nus.edu.sg/handle/10635/186960.

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

MLA Handbook (7th Edition):

ENXIAN, CHEN. “DYNAMIC GAMES AND GAMES WITH MANY PLAYERS.” 2020. Web. 11 Apr 2021.

Vancouver:

ENXIAN C. DYNAMIC GAMES AND GAMES WITH MANY PLAYERS. [Internet] [Thesis]. National University of Singapore; 2020. [cited 2021 Apr 11]. Available from: https://scholarbank.nus.edu.sg/handle/10635/186960.

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

Council of Science Editors:

ENXIAN C. DYNAMIC GAMES AND GAMES WITH MANY PLAYERS. [Thesis]. National University of Singapore; 2020. Available from: https://scholarbank.nus.edu.sg/handle/10635/186960

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


King Abdullah University of Science and Technology

4. Evangelista, David. Stationary Mean-Field Games with Congestion.

Degree: Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division, 2019, King Abdullah University of Science and Technology

 Mean-field games (MFG) are models of large populations of rational agents who seek to optimize an objective function that takes into account their state variables… (more)

Subjects/Keywords: mean-field games; congestion problems; stationary problems; calculus f variations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Evangelista, D. (2019). Stationary Mean-Field Games with Congestion. (Thesis). King Abdullah University of Science and Technology. Retrieved from http://hdl.handle.net/10754/655679

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):

Evangelista, David. “Stationary Mean-Field Games with Congestion.” 2019. Thesis, King Abdullah University of Science and Technology. Accessed April 11, 2021. http://hdl.handle.net/10754/655679.

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

MLA Handbook (7th Edition):

Evangelista, David. “Stationary Mean-Field Games with Congestion.” 2019. Web. 11 Apr 2021.

Vancouver:

Evangelista D. Stationary Mean-Field Games with Congestion. [Internet] [Thesis]. King Abdullah University of Science and Technology; 2019. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10754/655679.

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

Council of Science Editors:

Evangelista D. Stationary Mean-Field Games with Congestion. [Thesis]. King Abdullah University of Science and Technology; 2019. Available from: http://hdl.handle.net/10754/655679

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

5. Keijzer, B. de. Externalities and Cooperation in Algorithmic Game Theory .

Degree: 2014, Vrije Universiteit Amsterdam

Subjects/Keywords: games; algorithms; externalities; congestion; auction; cooperation; optimization

Congestion Games 3.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.2… …4.6 Linear Congestion Games . . . . . . . . . . . . 4.7 Symmetric Singleton Linear… …Congestion Games 4.7.1 Uniform Altruism . . . . . . . . . . . 4.7.2 Non-Uniform Altruism… …5.4 Linear Congestion Games . . . . . . . . . . . . . . . . . . . . . . . 5.5 Singleton… …Linear Congestion Games with Identical Delay Functions 5.6 Minsum Machine Scheduling… 

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):

Keijzer, B. d. (2014). Externalities and Cooperation in Algorithmic Game Theory . (Doctoral Dissertation). Vrije Universiteit Amsterdam. Retrieved from http://hdl.handle.net/1871/51284

Chicago Manual of Style (16th Edition):

Keijzer, B de. “Externalities and Cooperation in Algorithmic Game Theory .” 2014. Doctoral Dissertation, Vrije Universiteit Amsterdam. Accessed April 11, 2021. http://hdl.handle.net/1871/51284.

MLA Handbook (7th Edition):

Keijzer, B de. “Externalities and Cooperation in Algorithmic Game Theory .” 2014. Web. 11 Apr 2021.

Vancouver:

Keijzer Bd. Externalities and Cooperation in Algorithmic Game Theory . [Internet] [Doctoral dissertation]. Vrije Universiteit Amsterdam; 2014. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/1871/51284.

Council of Science Editors:

Keijzer Bd. Externalities and Cooperation in Algorithmic Game Theory . [Doctoral Dissertation]. Vrije Universiteit Amsterdam; 2014. Available from: http://hdl.handle.net/1871/51284

6. Lianeas, Athanasios. Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας.

Degree: 2015, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

 The subject of this thesis is the theoretical analysis and generalization of congestion games models and it aims to provide a study on methods for… (more)

Subjects/Keywords: Παίγνια συμφόρησης; Τίμημα της αναρχίας; Παράδοξο του μπράες; Τυχαίες καθυστερήσεις; Congestion games; Price of anarchy; Braess paradox; Random latencies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lianeas, A. (2015). Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/38905

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):

Lianeas, Athanasios. “Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας.” 2015. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed April 11, 2021. http://hdl.handle.net/10442/hedi/38905.

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

MLA Handbook (7th Edition):

Lianeas, Athanasios. “Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας.” 2015. Web. 11 Apr 2021.

Vancouver:

Lianeas A. Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2015. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10442/hedi/38905.

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

Council of Science Editors:

Lianeas A. Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2015. Available from: http://hdl.handle.net/10442/hedi/38905

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

7. Massicot, Olivier. On the role of signaling in mitigation of road-traffic congestion: The price of anarchy of signaling-based strategies in stochastic networks.

Degree: MS, Aerospace Engineering, 2019, University of Illinois – Urbana-Champaign

 We study the influence of information design on routing in the presence of vagaries, following the canonical congestion game approach. We allow a central controller… (more)

Subjects/Keywords: Road-traffic; congestion; signaling games; signal; information design; game theory; price of anarchy; Wardrop equilibrium; Bayesian game

…Chapter 2 Selfish routing 2.1 Routing as a congestion game In this first section, the… …reader will find how a road network is canonically modeled as a congestion game and the general… …the work on potential games of Monderer and Shapley [30]. The model we will use… …This game is a congestion game, so we should expect it to be a potential game. It is indeed… …theory literature on best-response dynamics of potential games, although we only focus on a… 

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):

Massicot, O. (2019). On the role of signaling in mitigation of road-traffic congestion: The price of anarchy of signaling-based strategies in stochastic networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/106130

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):

Massicot, Olivier. “On the role of signaling in mitigation of road-traffic congestion: The price of anarchy of signaling-based strategies in stochastic networks.” 2019. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/106130.

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

MLA Handbook (7th Edition):

Massicot, Olivier. “On the role of signaling in mitigation of road-traffic congestion: The price of anarchy of signaling-based strategies in stochastic networks.” 2019. Web. 11 Apr 2021.

Vancouver:

Massicot O. On the role of signaling in mitigation of road-traffic congestion: The price of anarchy of signaling-based strategies in stochastic networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2019. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/106130.

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

Council of Science Editors:

Massicot O. On the role of signaling in mitigation of road-traffic congestion: The price of anarchy of signaling-based strategies in stochastic networks. [Thesis]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/106130

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

8. Pradeau, Thomas. Congestion games with player-specific cost functions : Jeux de congestion avec fonctions de coût spécifiques à chaque joueur.

Degree: Docteur es, Mathématiques, 2014, Université Paris-Est

Nous considérons des jeux de congestion sur des graphes. Dans les jeux non-atomiques, nous considérons un ensemble de joueurs infinitésimaux. Chaque joueur veut aller d'un… (more)

Subjects/Keywords: Jeux de congestion; Théorie algorithmique des jeux; Jeux multiclasses; Jeux atomiques; Jeux non-Atomiques; Prix de l'anarchie; Network congestion games; Price of anarchy; Algorithmic game theory; Atomic games; Nonatomic games

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pradeau, T. (2014). Congestion games with player-specific cost functions : Jeux de congestion avec fonctions de coût spécifiques à chaque joueur. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2014PEST1096

Chicago Manual of Style (16th Edition):

Pradeau, Thomas. “Congestion games with player-specific cost functions : Jeux de congestion avec fonctions de coût spécifiques à chaque joueur.” 2014. Doctoral Dissertation, Université Paris-Est. Accessed April 11, 2021. http://www.theses.fr/2014PEST1096.

MLA Handbook (7th Edition):

Pradeau, Thomas. “Congestion games with player-specific cost functions : Jeux de congestion avec fonctions de coût spécifiques à chaque joueur.” 2014. Web. 11 Apr 2021.

Vancouver:

Pradeau T. Congestion games with player-specific cost functions : Jeux de congestion avec fonctions de coût spécifiques à chaque joueur. [Internet] [Doctoral dissertation]. Université Paris-Est; 2014. [cited 2021 Apr 11]. Available from: http://www.theses.fr/2014PEST1096.

Council of Science Editors:

Pradeau T. Congestion games with player-specific cost functions : Jeux de congestion avec fonctions de coût spécifiques à chaque joueur. [Doctoral Dissertation]. Université Paris-Est; 2014. Available from: http://www.theses.fr/2014PEST1096


University of Illinois – Urbana-Champaign

9. Yekkehkhany, Ali. Risk-averse multi-armed bandits and game theory.

Degree: PhD, Electrical & Computer Engr, 2020, University of Illinois – Urbana-Champaign

 The multi-armed bandit (MAB) and game theory literature is mainly focused on the expected cumulative reward and the expected payoffs in a game, respectively. In… (more)

Subjects/Keywords: Online Learning; Multi-Armed Bandits; Exploration-Exploitation; Explore-Then-Commit Bandits; Risk-Aversion; Game Theory; Stochastic Game Theory; Congestion Games; Affinity Scheduling; MapReduce; Data Center

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yekkehkhany, A. (2020). Risk-averse multi-armed bandits and game theory. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/108439

Chicago Manual of Style (16th Edition):

Yekkehkhany, Ali. “Risk-averse multi-armed bandits and game theory.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/108439.

MLA Handbook (7th Edition):

Yekkehkhany, Ali. “Risk-averse multi-armed bandits and game theory.” 2020. Web. 11 Apr 2021.

Vancouver:

Yekkehkhany A. Risk-averse multi-armed bandits and game theory. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/108439.

Council of Science Editors:

Yekkehkhany A. Risk-averse multi-armed bandits and game theory. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/108439


Université Paris-Sud – Paris XI

10. Zeitoun, Xavier. Complexité des dynamiques de jeux : Complexity of games dynamics.

Degree: Docteur es, Informatique, 2013, Université Paris-Sud – Paris XI

La th´eorie de la complexit´e permet de classifier les probl`emes en fonction de leur difficult´e. Le cadre classique dans lequel elle s’applique est celui d’un… (more)

Subjects/Keywords: Complexité; Equilibre de Nash; Dynamique; Jeux de congestion; Couplage stable; Complexity; Nash equilibrium; Dynamics; Congestion games; Stable matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zeitoun, X. (2013). Complexité des dynamiques de jeux : Complexity of games dynamics. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2013PA112083

Chicago Manual of Style (16th Edition):

Zeitoun, Xavier. “Complexité des dynamiques de jeux : Complexity of games dynamics.” 2013. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed April 11, 2021. http://www.theses.fr/2013PA112083.

MLA Handbook (7th Edition):

Zeitoun, Xavier. “Complexité des dynamiques de jeux : Complexity of games dynamics.” 2013. Web. 11 Apr 2021.

Vancouver:

Zeitoun X. Complexité des dynamiques de jeux : Complexity of games dynamics. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2013. [cited 2021 Apr 11]. Available from: http://www.theses.fr/2013PA112083.

Council of Science Editors:

Zeitoun X. Complexité des dynamiques de jeux : Complexity of games dynamics. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2013. Available from: http://www.theses.fr/2013PA112083


Georgia Tech

11. Zhong, Hai. Congestion game-based task allocation for multi-robot teams.

Degree: MS, Electrical and Computer Engineering, 2020, Georgia Tech

 Multi-robot teams can complete complex missions that are not amenable to an individual robot. A team of heterogeneous robots with complementing capabilities is endowed with… (more)

Subjects/Keywords: Multi-robot systems; Task allocation; Congestion games

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhong, H. (2020). Congestion game-based task allocation for multi-robot teams. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62843

Chicago Manual of Style (16th Edition):

Zhong, Hai. “Congestion game-based task allocation for multi-robot teams.” 2020. Masters Thesis, Georgia Tech. Accessed April 11, 2021. http://hdl.handle.net/1853/62843.

MLA Handbook (7th Edition):

Zhong, Hai. “Congestion game-based task allocation for multi-robot teams.” 2020. Web. 11 Apr 2021.

Vancouver:

Zhong H. Congestion game-based task allocation for multi-robot teams. [Internet] [Masters thesis]. Georgia Tech; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/1853/62843.

Council of Science Editors:

Zhong H. Congestion game-based task allocation for multi-robot teams. [Masters Thesis]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/62843

.