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:(algorithmic game). Showing records 1 – 30 of 40 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Cornell University

1. Oren, Sigal. An Algorithmic Approach To Analyzing Social Phenomena.

Degree: PhD, Computer Science, 2013, Cornell University

 Online information and interaction is becoming more and more prominent in our lives. This development is made possible by the growth of large-scale userbased applications… (more)

Subjects/Keywords: Algorithmic game theory; social networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oren, S. (2013). An Algorithmic Approach To Analyzing Social Phenomena. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/34358

Chicago Manual of Style (16th Edition):

Oren, Sigal. “An Algorithmic Approach To Analyzing Social Phenomena.” 2013. Doctoral Dissertation, Cornell University. Accessed September 24, 2020. http://hdl.handle.net/1813/34358.

MLA Handbook (7th Edition):

Oren, Sigal. “An Algorithmic Approach To Analyzing Social Phenomena.” 2013. Web. 24 Sep 2020.

Vancouver:

Oren S. An Algorithmic Approach To Analyzing Social Phenomena. [Internet] [Doctoral dissertation]. Cornell University; 2013. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1813/34358.

Council of Science Editors:

Oren S. An Algorithmic Approach To Analyzing Social Phenomena. [Doctoral Dissertation]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/34358


University of Debrecen

2. Hamam, Faris. On Algorithmic Game Theory .

Degree: DE – Informatikai Kar, University of Debrecen

An introduction to Game Theory and a combinatorial algorithm for calculating market equilibria, prices and goods allocation. Advisors/Committee Members: Gilányi, Attila (advisor).

Subjects/Keywords: Algorithmic Game

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hamam, F. (n.d.). On Algorithmic Game Theory . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/238913

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hamam, Faris. “On Algorithmic Game Theory .” Thesis, University of Debrecen. Accessed September 24, 2020. http://hdl.handle.net/2437/238913.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hamam, Faris. “On Algorithmic Game Theory .” Web. 24 Sep 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Hamam F. On Algorithmic Game Theory . [Internet] [Thesis]. University of Debrecen; [cited 2020 Sep 24]. Available from: http://hdl.handle.net/2437/238913.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Hamam F. On Algorithmic Game Theory . [Thesis]. University of Debrecen; Available from: http://hdl.handle.net/2437/238913

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


University of Waterloo

3. Tofigzade, Natig. An Algorithm for Stable Matching with Approximation up to the Integrality Gap.

Degree: 2020, University of Waterloo

 In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of… (more)

Subjects/Keywords: Combinatorial Optimization; Stable Matching; Algorithmic Game Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tofigzade, N. (2020). An Algorithm for Stable Matching with Approximation up to the Integrality Gap. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16052

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

Tofigzade, Natig. “An Algorithm for Stable Matching with Approximation up to the Integrality Gap.” 2020. Thesis, University of Waterloo. Accessed September 24, 2020. http://hdl.handle.net/10012/16052.

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

MLA Handbook (7th Edition):

Tofigzade, Natig. “An Algorithm for Stable Matching with Approximation up to the Integrality Gap.” 2020. Web. 24 Sep 2020.

Vancouver:

Tofigzade N. An Algorithm for Stable Matching with Approximation up to the Integrality Gap. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10012/16052.

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

Council of Science Editors:

Tofigzade N. An Algorithm for Stable Matching with Approximation up to the Integrality Gap. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16052

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

4. Skoulakis, Efstratios - Panteleimon. Φυσικές και αποδοτικές δυναμικές σε παίγνια διαμόρφωσης άποψης μέσω τεχνικών κυρτής βελτιστοποίησης.

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

 The subject of this thesis is the use of convex optimization techniques to study the dynamic behavior of the agents’ strategies and the Price of… (more)

Subjects/Keywords: Αλγοριθμική θεωρία παιγνίων; Algorithmic game theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Skoulakis, E. -. P. (2019). Φυσικές και αποδοτικές δυναμικές σε παίγνια διαμόρφωσης άποψης μέσω τεχνικών κυρτής βελτιστοποίησης. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/46365

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

Skoulakis, Efstratios - Panteleimon. “Φυσικές και αποδοτικές δυναμικές σε παίγνια διαμόρφωσης άποψης μέσω τεχνικών κυρτής βελτιστοποίησης.” 2019. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed September 24, 2020. http://hdl.handle.net/10442/hedi/46365.

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

MLA Handbook (7th Edition):

Skoulakis, Efstratios - Panteleimon. “Φυσικές και αποδοτικές δυναμικές σε παίγνια διαμόρφωσης άποψης μέσω τεχνικών κυρτής βελτιστοποίησης.” 2019. Web. 24 Sep 2020.

Vancouver:

Skoulakis E-P. Φυσικές και αποδοτικές δυναμικές σε παίγνια διαμόρφωσης άποψης μέσω τεχνικών κυρτής βελτιστοποίησης. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2019. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10442/hedi/46365.

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

Council of Science Editors:

Skoulakis E-P. Φυσικές και αποδοτικές δυναμικές σε παίγνια διαμόρφωσης άποψης μέσω τεχνικών κυρτής βελτιστοποίησης. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2019. Available from: http://hdl.handle.net/10442/hedi/46365

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


University of Illinois – Urbana-Champaign

5. Lee, Wei-Chun. On resource distribution in network coordination game.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

 Product adoption is an important topic from the marketing perspective. People want to understand how a new product penetrates a market. Researchers propose many models… (more)

Subjects/Keywords: Game theory; Resource distribution; Algorithmic game theory; Network coordination game; Product adoption

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, W. (2017). On resource distribution in network coordination game. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97760

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

Lee, Wei-Chun. “On resource distribution in network coordination game.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed September 24, 2020. http://hdl.handle.net/2142/97760.

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

MLA Handbook (7th Edition):

Lee, Wei-Chun. “On resource distribution in network coordination game.” 2017. Web. 24 Sep 2020.

Vancouver:

Lee W. On resource distribution in network coordination game. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/2142/97760.

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

Council of Science Editors:

Lee W. On resource distribution in network coordination game. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97760

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


Temple University

6. Delgado, Lisa A. Matching Market for Skills.

Degree: PhD, 2009, Temple University

Economics

This dissertation builds a model of information exchange, where the information is skills. A two-sided matching market for skills is employed that includes two… (more)

Subjects/Keywords: Economics, Theory; algorithmic game; correlated equilibrium; game theory; matching market; Nash equilibrium; skills market

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Delgado, L. A. (2009). Matching Market for Skills. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,41030

Chicago Manual of Style (16th Edition):

Delgado, Lisa A. “Matching Market for Skills.” 2009. Doctoral Dissertation, Temple University. Accessed September 24, 2020. http://digital.library.temple.edu/u?/p245801coll10,41030.

MLA Handbook (7th Edition):

Delgado, Lisa A. “Matching Market for Skills.” 2009. Web. 24 Sep 2020.

Vancouver:

Delgado LA. Matching Market for Skills. [Internet] [Doctoral dissertation]. Temple University; 2009. [cited 2020 Sep 24]. Available from: http://digital.library.temple.edu/u?/p245801coll10,41030.

Council of Science Editors:

Delgado LA. Matching Market for Skills. [Doctoral Dissertation]. Temple University; 2009. Available from: http://digital.library.temple.edu/u?/p245801coll10,41030


University of Oxford

7. Najib, Muhammad. Rational verification in multi-agent systems.

Degree: PhD, 2020, University of Oxford

 Rational verification problem is concerned with checking which temporal logic properties will hold in a system composed of multiple agents which are assumed to behave… (more)

Subjects/Keywords: Algorithmic Game Theory; Multi-Agent Systems; Formal Verification; Artificial intelligence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Najib, M. (2020). Rational verification in multi-agent systems. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:6331464c-c483-48b8-b030-58e431047614 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804309

Chicago Manual of Style (16th Edition):

Najib, Muhammad. “Rational verification in multi-agent systems.” 2020. Doctoral Dissertation, University of Oxford. Accessed September 24, 2020. http://ora.ox.ac.uk/objects/uuid:6331464c-c483-48b8-b030-58e431047614 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804309.

MLA Handbook (7th Edition):

Najib, Muhammad. “Rational verification in multi-agent systems.” 2020. Web. 24 Sep 2020.

Vancouver:

Najib M. Rational verification in multi-agent systems. [Internet] [Doctoral dissertation]. University of Oxford; 2020. [cited 2020 Sep 24]. Available from: http://ora.ox.ac.uk/objects/uuid:6331464c-c483-48b8-b030-58e431047614 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804309.

Council of Science Editors:

Najib M. Rational verification in multi-agent systems. [Doctoral Dissertation]. University of Oxford; 2020. Available from: http://ora.ox.ac.uk/objects/uuid:6331464c-c483-48b8-b030-58e431047614 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804309

8. Briest, Patrick. Computational aspects of combinatorial pricing problems.

Degree: 2007, Technische Universität Dortmund

 Combinatorial pricing encompasses a wide range of natural optimization problems that arise in the computation of revenue maximizing pricing schemes for a given set of… (more)

Subjects/Keywords: algorithmic game theory; approximation algorithms; hardness of approximation; pricing; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Briest, P. (2007). Computational aspects of combinatorial pricing problems. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/24877

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

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Thesis, Technische Universität Dortmund. Accessed September 24, 2020. http://hdl.handle.net/2003/24877.

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

MLA Handbook (7th Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Web. 24 Sep 2020.

Vancouver:

Briest P. Computational aspects of combinatorial pricing problems. [Internet] [Thesis]. Technische Universität Dortmund; 2007. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/2003/24877.

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

Council of Science Editors:

Briest P. Computational aspects of combinatorial pricing problems. [Thesis]. Technische Universität Dortmund; 2007. Available from: http://hdl.handle.net/2003/24877

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


University of Toronto

9. Drummond, Joanna. Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges.

Degree: PhD, 2017, University of Toronto

 Matching markets are ubiquitous, including college admissions, school choice, reviewer paper matching, and various labour market matchings. Many of these matching markets run centralized matching… (more)

Subjects/Keywords: Algorithmic Game Theory; Artificial Intelligence; Computational Economics; Stable Matching; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Drummond, J. (2017). Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/80643

Chicago Manual of Style (16th Edition):

Drummond, Joanna. “Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges.” 2017. Doctoral Dissertation, University of Toronto. Accessed September 24, 2020. http://hdl.handle.net/1807/80643.

MLA Handbook (7th Edition):

Drummond, Joanna. “Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges.” 2017. Web. 24 Sep 2020.

Vancouver:

Drummond J. Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1807/80643.

Council of Science Editors:

Drummond J. Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges. [Doctoral Dissertation]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/80643

10. Kouroupas, Georgios. Μελέτη του παγκόσμιου ιστού με χρήση θεωρίας οικονομικών και παιγνίων.

Degree: 2015, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών

The worldwide web is created, supported, used, and run by a multitude of selfish, optimizing economic agents with various and dynamically varying degrees of competition… (more)

Subjects/Keywords: Παγκόσμιος ιστός; Αλγοριθμική θεωρία παιγνίων; World wide web; Algorithmic game theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kouroupas, G. (2015). Μελέτη του παγκόσμιου ιστού με χρήση θεωρίας οικονομικών και παιγνίων. (Thesis). Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Retrieved from http://hdl.handle.net/10442/hedi/36211

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

Kouroupas, Georgios. “Μελέτη του παγκόσμιου ιστού με χρήση θεωρίας οικονομικών και παιγνίων.” 2015. Thesis, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Accessed September 24, 2020. http://hdl.handle.net/10442/hedi/36211.

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

MLA Handbook (7th Edition):

Kouroupas, Georgios. “Μελέτη του παγκόσμιου ιστού με χρήση θεωρίας οικονομικών και παιγνίων.” 2015. Web. 24 Sep 2020.

Vancouver:

Kouroupas G. Μελέτη του παγκόσμιου ιστού με χρήση θεωρίας οικονομικών και παιγνίων. [Internet] [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2015. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10442/hedi/36211.

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

Council of Science Editors:

Kouroupas G. Μελέτη του παγκόσμιου ιστού με χρήση θεωρίας οικονομικών και παιγνίων. [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2015. Available from: http://hdl.handle.net/10442/hedi/36211

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


Cornell University

11. Niazadeh, Rad. Algorithms vs. Mechanisms: Mechanism Design for Complex Environments.

Degree: PhD, Computer Science, 2017, Cornell University

 Prevalent internet marketplaces and crowdsourcing platforms have started facing new computational challenges. In point of fact, these challenges exist mostly due to the strategic behavior… (more)

Subjects/Keywords: Economics; Operations research; Computer science; Online learning; Algorithmic Game Theory; Algorithmic Mechanism Design; Approximation Mechanism Design; Blackbox Reductions; Complex Environments

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Niazadeh, R. (2017). Algorithms vs. Mechanisms: Mechanism Design for Complex Environments. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/56874

Chicago Manual of Style (16th Edition):

Niazadeh, Rad. “Algorithms vs. Mechanisms: Mechanism Design for Complex Environments.” 2017. Doctoral Dissertation, Cornell University. Accessed September 24, 2020. http://hdl.handle.net/1813/56874.

MLA Handbook (7th Edition):

Niazadeh, Rad. “Algorithms vs. Mechanisms: Mechanism Design for Complex Environments.” 2017. Web. 24 Sep 2020.

Vancouver:

Niazadeh R. Algorithms vs. Mechanisms: Mechanism Design for Complex Environments. [Internet] [Doctoral dissertation]. Cornell University; 2017. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1813/56874.

Council of Science Editors:

Niazadeh R. Algorithms vs. Mechanisms: Mechanism Design for Complex Environments. [Doctoral Dissertation]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/56874


University of Toronto

12. Casgrain, Philippe. Algorithmic Trading with Latent Models and Mean-Field Games.

Degree: PhD, 2019, University of Toronto

 This thesis explores how agents should optimally trade in electronic markets when they account for latent factors and the optimal actions of other traders. It… (more)

Subjects/Keywords: Algorithmic Trading; Game Theory; Mathematical Finance; Mean-Field Games; Probability; Stochastic Control; 0364

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Casgrain, P. (2019). Algorithmic Trading with Latent Models and Mean-Field Games. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/95757

Chicago Manual of Style (16th Edition):

Casgrain, Philippe. “Algorithmic Trading with Latent Models and Mean-Field Games.” 2019. Doctoral Dissertation, University of Toronto. Accessed September 24, 2020. http://hdl.handle.net/1807/95757.

MLA Handbook (7th Edition):

Casgrain, Philippe. “Algorithmic Trading with Latent Models and Mean-Field Games.” 2019. Web. 24 Sep 2020.

Vancouver:

Casgrain P. Algorithmic Trading with Latent Models and Mean-Field Games. [Internet] [Doctoral dissertation]. University of Toronto; 2019. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1807/95757.

Council of Science Editors:

Casgrain P. Algorithmic Trading with Latent Models and Mean-Field Games. [Doctoral Dissertation]. University of Toronto; 2019. Available from: http://hdl.handle.net/1807/95757


University of Illinois – Urbana-Champaign

13. Gordon, Spencer L. The complexity of continuous local search.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

 The complexity class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the complexity of some well-known problems in PPAD… (more)

Subjects/Keywords: Theoretical computer science; Algorithmic game theory; Computational complexity; Linear complementarity problem; Contraction map

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gordon, S. L. (2017). The complexity of continuous local search. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97391

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

Gordon, Spencer L. “The complexity of continuous local search.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed September 24, 2020. http://hdl.handle.net/2142/97391.

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

MLA Handbook (7th Edition):

Gordon, Spencer L. “The complexity of continuous local search.” 2017. Web. 24 Sep 2020.

Vancouver:

Gordon SL. The complexity of continuous local search. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/2142/97391.

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

Council of Science Editors:

Gordon SL. The complexity of continuous local search. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97391

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


University of Southern California

14. Salek, Mahyar. Computational and economic aspects of procurement and sale.

Degree: PhD, Computer Science, 2011, University of Southern California

 Theoretical computer science has introduced new paradigms to game theory and mechanism design. First, it has motivated the design of mechanisms in information-poor environments (prior-free… (more)

Subjects/Keywords: algorithmic game theory; mechanism design; procurement; frugality; truthfulness; false-name; spectral; externality; microeconomics; algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Salek, M. (2011). Computational and economic aspects of procurement and sale. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/175580/rec/1541

Chicago Manual of Style (16th Edition):

Salek, Mahyar. “Computational and economic aspects of procurement and sale.” 2011. Doctoral Dissertation, University of Southern California. Accessed September 24, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/175580/rec/1541.

MLA Handbook (7th Edition):

Salek, Mahyar. “Computational and economic aspects of procurement and sale.” 2011. Web. 24 Sep 2020.

Vancouver:

Salek M. Computational and economic aspects of procurement and sale. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2020 Sep 24]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/175580/rec/1541.

Council of Science Editors:

Salek M. Computational and economic aspects of procurement and sale. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/175580/rec/1541

15. Tsaousoglou, Georgios. Demand side management in smart electricity networks: algorithmic, economic and game - theoretic aspects of active user participation.

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

 Modern energy policies drive the electricity market towards a liberalized framework. As a result, concepts from other commodity markets are becoming increasingly relevant in the… (more)

Subjects/Keywords: Τσαούσογλου; Έξυπνα δίκτυα ενέργειας; Αλγοριθμική θεωρία παιγνίων; Διαχείριση ζήτησης; Tsaousoglou; Smart grid; Algorithmic game theory; Demand response

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsaousoglou, G. (2019). Demand side management in smart electricity networks: algorithmic, economic and game - theoretic aspects of active user participation. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/45484

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

Tsaousoglou, Georgios. “Demand side management in smart electricity networks: algorithmic, economic and game - theoretic aspects of active user participation.” 2019. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed September 24, 2020. http://hdl.handle.net/10442/hedi/45484.

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

MLA Handbook (7th Edition):

Tsaousoglou, Georgios. “Demand side management in smart electricity networks: algorithmic, economic and game - theoretic aspects of active user participation.” 2019. Web. 24 Sep 2020.

Vancouver:

Tsaousoglou G. Demand side management in smart electricity networks: algorithmic, economic and game - theoretic aspects of active user participation. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2019. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10442/hedi/45484.

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

Council of Science Editors:

Tsaousoglou G. Demand side management in smart electricity networks: algorithmic, economic and game - theoretic aspects of active user participation. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2019. Available from: http://hdl.handle.net/10442/hedi/45484

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


Duke University

16. Deng, Yuan. Dynamic Mechanism Design in Complex Environments .

Degree: 2020, Duke University

  Inspired by various applications including ad auctions, matching markets, and voting, mechanism design deals with the problem of designing algorithms that take inputs from… (more)

Subjects/Keywords: Computer science; Economic theory; Algorithmic Game Theory; Approximation; Hypothesis Testing; Mechanism Design; Online Advertising; Online Learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deng, Y. (2020). Dynamic Mechanism Design in Complex Environments . (Thesis). Duke University. Retrieved from http://hdl.handle.net/10161/20862

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

Deng, Yuan. “Dynamic Mechanism Design in Complex Environments .” 2020. Thesis, Duke University. Accessed September 24, 2020. http://hdl.handle.net/10161/20862.

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

MLA Handbook (7th Edition):

Deng, Yuan. “Dynamic Mechanism Design in Complex Environments .” 2020. Web. 24 Sep 2020.

Vancouver:

Deng Y. Dynamic Mechanism Design in Complex Environments . [Internet] [Thesis]. Duke University; 2020. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10161/20862.

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

Council of Science Editors:

Deng Y. Dynamic Mechanism Design in Complex Environments . [Thesis]. Duke University; 2020. Available from: http://hdl.handle.net/10161/20862

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

17. Van Ransbeeck, Samuel. Composição com autómatos celulares.

Degree: 2009, Instituto Politécnico do Porto

Os autómatos celulares são interessantes modelos teóricos para a modelagem de processos complexos, tornando-os mais fáceis de entender. Estes modelos têm sido utilizados em diversos… (more)

Subjects/Keywords: Composição algorítmica; Autómatos celulares; O Jogo da Vida; Algorithmic composition; Cellular automata; The Game of Life

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Ransbeeck, S. (2009). Composição com autómatos celulares. (Thesis). Instituto Politécnico do Porto. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/9591

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

Van Ransbeeck, Samuel. “Composição com autómatos celulares.” 2009. Thesis, Instituto Politécnico do Porto. Accessed September 24, 2020. https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/9591.

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

MLA Handbook (7th Edition):

Van Ransbeeck, Samuel. “Composição com autómatos celulares.” 2009. Web. 24 Sep 2020.

Vancouver:

Van Ransbeeck S. Composição com autómatos celulares. [Internet] [Thesis]. Instituto Politécnico do Porto; 2009. [cited 2020 Sep 24]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/9591.

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

Council of Science Editors:

Van Ransbeeck S. Composição com autómatos celulares. [Thesis]. Instituto Politécnico do Porto; 2009. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/9591

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


Université Catholique de Louvain

18. Hollanders, Romain. Decision making in large stochastic and adversarial environments : a complexity analysis of Policy Iteration.

Degree: 2015, Université Catholique de Louvain

How to make the best decision in a complex environment is a question that has haunted many generations of researchers and practitioners. It has given… (more)

Subjects/Keywords: Policy Iteration; Markov Decision Process; Acyclic Unique Sink Orientation; Two-Player Turn-Based Stochastic Game; Algorithmic Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hollanders, R. (2015). Decision making in large stochastic and adversarial environments : a complexity analysis of Policy Iteration. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/169209

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

Hollanders, Romain. “Decision making in large stochastic and adversarial environments : a complexity analysis of Policy Iteration.” 2015. Thesis, Université Catholique de Louvain. Accessed September 24, 2020. http://hdl.handle.net/2078.1/169209.

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

MLA Handbook (7th Edition):

Hollanders, Romain. “Decision making in large stochastic and adversarial environments : a complexity analysis of Policy Iteration.” 2015. Web. 24 Sep 2020.

Vancouver:

Hollanders R. Decision making in large stochastic and adversarial environments : a complexity analysis of Policy Iteration. [Internet] [Thesis]. Université Catholique de Louvain; 2015. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/2078.1/169209.

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

Council of Science Editors:

Hollanders R. Decision making in large stochastic and adversarial environments : a complexity analysis of Policy Iteration. [Thesis]. Université Catholique de Louvain; 2015. Available from: http://hdl.handle.net/2078.1/169209

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

19. Amanatidis, Georgios. Algorithmic and mechanism design aspects of problems with limited -or no - payments.

Degree: 2017, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών

 The most notable distinction between algorithm design and mechanism design is the notion of truthfulness. Typically, one of the goals of the mechanism designer is… (more)

Subjects/Keywords: Αλγοριθμική θεωρία παιγνίων; Αντίστροφες δημοπρασίες; Δίκαιος διαμοιρασμός μη διαιρετών αγαθών; Algorithmic game theory; Procurement auctions; Fair division of indivisible items

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Amanatidis, G. (2017). Algorithmic and mechanism design aspects of problems with limited -or no - payments. (Thesis). Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Retrieved from http://hdl.handle.net/10442/hedi/41712

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

Amanatidis, Georgios. “Algorithmic and mechanism design aspects of problems with limited -or no - payments.” 2017. Thesis, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Accessed September 24, 2020. http://hdl.handle.net/10442/hedi/41712.

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

MLA Handbook (7th Edition):

Amanatidis, Georgios. “Algorithmic and mechanism design aspects of problems with limited -or no - payments.” 2017. Web. 24 Sep 2020.

Vancouver:

Amanatidis G. Algorithmic and mechanism design aspects of problems with limited -or no - payments. [Internet] [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2017. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10442/hedi/41712.

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

Council of Science Editors:

Amanatidis G. Algorithmic and mechanism design aspects of problems with limited -or no - payments. [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2017. Available from: http://hdl.handle.net/10442/hedi/41712

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

20. Koutsiamanis, Remous - Aris. Distributed management of competitive access to common resources using algorithmic game theory.

Degree: 2016, Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ)

 The Internet is today an inextricable part of daily personal, educational and business activity, turning any problems in its operation or availability into a significant… (more)

Subjects/Keywords: Αλγόριθμοι; Δίκτυα υπολογιστών; Αλγοριθμική θεωρία παιγνίων; Διαχείριση πόρων; Ανταγωνιστική πρόσβαση; Algorithm; Computer networks; Algorithmic game theory; Resource management; Competitive access

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koutsiamanis, R. -. A. (2016). Distributed management of competitive access to common resources using algorithmic game theory. (Thesis). Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/37381

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

Koutsiamanis, Remous - Aris. “Distributed management of competitive access to common resources using algorithmic game theory.” 2016. Thesis, Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ). Accessed September 24, 2020. http://hdl.handle.net/10442/hedi/37381.

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

MLA Handbook (7th Edition):

Koutsiamanis, Remous - Aris. “Distributed management of competitive access to common resources using algorithmic game theory.” 2016. Web. 24 Sep 2020.

Vancouver:

Koutsiamanis R-A. Distributed management of competitive access to common resources using algorithmic game theory. [Internet] [Thesis]. Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ); 2016. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10442/hedi/37381.

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

Council of Science Editors:

Koutsiamanis R-A. Distributed management of competitive access to common resources using algorithmic game theory. [Thesis]. Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ); 2016. Available from: http://hdl.handle.net/10442/hedi/37381

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

21. Schouery, Rafael Crivellari Saliba. Problemas de alocação e precificação de itens.

Degree: PhD, Ciência da Computação, 2014, University of São Paulo

Nessa tese consideramos problemas de alocação e precificação de itens, onde temos um conjunto de itens e um conjunto de compradores interessados em tais itens.… (more)

Subjects/Keywords: Algorithmic Game Theory; Algoritmo de Aproximação; Approximation Algorithm; Auction; Combinatorial Optimization; Integer Programming; Leilão; Otimização Combinatória; Precificação; Pricing; Programação Inteira; Teoria dos Jogos Algorítmica

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schouery, R. C. S. (2014). Problemas de alocação e precificação de itens. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-25022014-112039/ ;

Chicago Manual of Style (16th Edition):

Schouery, Rafael Crivellari Saliba. “Problemas de alocação e precificação de itens.” 2014. Doctoral Dissertation, University of São Paulo. Accessed September 24, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-25022014-112039/ ;.

MLA Handbook (7th Edition):

Schouery, Rafael Crivellari Saliba. “Problemas de alocação e precificação de itens.” 2014. Web. 24 Sep 2020.

Vancouver:

Schouery RCS. Problemas de alocação e precificação de itens. [Internet] [Doctoral dissertation]. University of São Paulo; 2014. [cited 2020 Sep 24]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-25022014-112039/ ;.

Council of Science Editors:

Schouery RCS. Problemas de alocação e precificação de itens. [Doctoral Dissertation]. University of São Paulo; 2014. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-25022014-112039/ ;

22. 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 September 24, 2020. 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. 24 Sep 2020.

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 2020 Sep 24]. 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

23. Briest, Patrick. Computational aspects of combinatorial pricing problems.

Degree: 2007, Technische Universität Dortmund

 Combinatorial pricing encompasses a wide range of natural optimization problems that arise in the computation of revenue maximizing pricing schemes for a given set of… (more)

Subjects/Keywords: approximation algorithms; hardness of approximation; pricing; algorithmic game theory; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Briest, P. (2007). Computational aspects of combinatorial pricing problems. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-483

Chicago Manual of Style (16th Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Doctoral Dissertation, Technische Universität Dortmund. Accessed September 24, 2020. http://dx.doi.org/10.17877/DE290R-483.

MLA Handbook (7th Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Web. 24 Sep 2020.

Vancouver:

Briest P. Computational aspects of combinatorial pricing problems. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2007. [cited 2020 Sep 24]. Available from: http://dx.doi.org/10.17877/DE290R-483.

Council of Science Editors:

Briest P. Computational aspects of combinatorial pricing problems. [Doctoral Dissertation]. Technische Universität Dortmund; 2007. Available from: http://dx.doi.org/10.17877/DE290R-483


Universidade do Rio Grande do Sul

24. Rodrigues, Félix Carvalho. Smoothed analysis in Nash equilibria and the Price of Anarchy.

Degree: 2012, Universidade do Rio Grande do Sul

São analisados nesta dissertação problemas em teoria dos jogos, com enfoque no efeito que perturbações acarretam em jogos. A análise suavizada (smoothed analysis) é utilizada… (more)

Subjects/Keywords: Inteligência artificial; Algorithmic game theory; Smoothed analysis; Algoritmos; Lemke-Howson algorithm; Teoria : Jogos; Bimatrix games; Frank-Wolfe algorithm; Network games; Traffic assignment problem; Price of anarchy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rodrigues, F. C. (2012). Smoothed analysis in Nash equilibria and the Price of Anarchy. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/54866

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

Rodrigues, Félix Carvalho. “Smoothed analysis in Nash equilibria and the Price of Anarchy.” 2012. Thesis, Universidade do Rio Grande do Sul. Accessed September 24, 2020. http://hdl.handle.net/10183/54866.

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

MLA Handbook (7th Edition):

Rodrigues, Félix Carvalho. “Smoothed analysis in Nash equilibria and the Price of Anarchy.” 2012. Web. 24 Sep 2020.

Vancouver:

Rodrigues FC. Smoothed analysis in Nash equilibria and the Price of Anarchy. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2012. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10183/54866.

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

Council of Science Editors:

Rodrigues FC. Smoothed analysis in Nash equilibria and the Price of Anarchy. [Thesis]. Universidade do Rio Grande do Sul; 2012. Available from: http://hdl.handle.net/10183/54866

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


University of Newcastle

25. Redhead, Tracy. Dynamic music: the implications of interactive technologies on popular music making.

Degree: PhD, 2020, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

The thesis investigates the role of interactive technologies on popular music making. Popular music has always adapted to… (more)

Subjects/Keywords: dynamic music; interactive technologies; reactive music; contextual music; interactive music; algorithmic music; popular music; future music; generative music; adaptive music; game audio; music composition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Redhead, T. (2020). Dynamic music: the implications of interactive technologies on popular music making. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1413444

Chicago Manual of Style (16th Edition):

Redhead, Tracy. “Dynamic music: the implications of interactive technologies on popular music making.” 2020. Doctoral Dissertation, University of Newcastle. Accessed September 24, 2020. http://hdl.handle.net/1959.13/1413444.

MLA Handbook (7th Edition):

Redhead, Tracy. “Dynamic music: the implications of interactive technologies on popular music making.” 2020. Web. 24 Sep 2020.

Vancouver:

Redhead T. Dynamic music: the implications of interactive technologies on popular music making. [Internet] [Doctoral dissertation]. University of Newcastle; 2020. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1959.13/1413444.

Council of Science Editors:

Redhead T. Dynamic music: the implications of interactive technologies on popular music making. [Doctoral Dissertation]. University of Newcastle; 2020. Available from: http://hdl.handle.net/1959.13/1413444

26. Ismaïli, Anisse. Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games : Algorithmes pour les équilibres de Nash dans les jeux graphiques et pour l'efficacité de Pareto dans les espaces d'états : généralisation à Pareto-Nash dans les jeux à multiples objectifs.

Degree: Docteur es, Informatique, 2016, Université Pierre et Marie Curie – Paris VI

Un agent est un élément qui décide une action. Par ce formalisme très général on peut aussi bien désigner deux enfants jouant à pierre-papier-ciseaux, des… (more)

Subjects/Keywords: Théorie des jeux; Jeux graphiques; Recherche dans les espaces d'états; Multi-Objectif; Rationalité limité; Jeux à multiples objectifs; Graphical games; Algorithmic game theory; Multiple objectives; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ismaïli, A. (2016). Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games : Algorithmes pour les équilibres de Nash dans les jeux graphiques et pour l'efficacité de Pareto dans les espaces d'états : généralisation à Pareto-Nash dans les jeux à multiples objectifs. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2016PA066148

Chicago Manual of Style (16th Edition):

Ismaïli, Anisse. “Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games : Algorithmes pour les équilibres de Nash dans les jeux graphiques et pour l'efficacité de Pareto dans les espaces d'états : généralisation à Pareto-Nash dans les jeux à multiples objectifs.” 2016. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed September 24, 2020. http://www.theses.fr/2016PA066148.

MLA Handbook (7th Edition):

Ismaïli, Anisse. “Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games : Algorithmes pour les équilibres de Nash dans les jeux graphiques et pour l'efficacité de Pareto dans les espaces d'états : généralisation à Pareto-Nash dans les jeux à multiples objectifs.” 2016. Web. 24 Sep 2020.

Vancouver:

Ismaïli A. Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games : Algorithmes pour les équilibres de Nash dans les jeux graphiques et pour l'efficacité de Pareto dans les espaces d'états : généralisation à Pareto-Nash dans les jeux à multiples objectifs. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. [cited 2020 Sep 24]. Available from: http://www.theses.fr/2016PA066148.

Council of Science Editors:

Ismaïli A. Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games : Algorithmes pour les équilibres de Nash dans les jeux graphiques et pour l'efficacité de Pareto dans les espaces d'états : généralisation à Pareto-Nash dans les jeux à multiples objectifs. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. Available from: http://www.theses.fr/2016PA066148

27. Lucier, Brendan. The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information.

Degree: 2011, University of Toronto

The field of algorithmic mechanism design is concerned with the design of computationally efficient algorithms for use when inputs are provided by rational agents, who… (more)

Subjects/Keywords: Algorithmic game theory; Mechanism design; Auctions; Algorithms; 0984

…routers; these are some of the many examples of algorithmic topics in which the nuances of real… …merge the computational considerations of computer science with the game-theoretic insights of… …human users. The area of research that addresses this intersection is known as algorithmic… …behaving as the auction designer wishes. As an algorithmic mechanism designer, one generally… …The primary goal of algorithmic mechanism design, then, is to determine to what extent the… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lucier, B. (2011). The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/31843

Chicago Manual of Style (16th Edition):

Lucier, Brendan. “The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information.” 2011. Doctoral Dissertation, University of Toronto. Accessed September 24, 2020. http://hdl.handle.net/1807/31843.

MLA Handbook (7th Edition):

Lucier, Brendan. “The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information.” 2011. Web. 24 Sep 2020.

Vancouver:

Lucier B. The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information. [Internet] [Doctoral dissertation]. University of Toronto; 2011. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1807/31843.

Council of Science Editors:

Lucier B. The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information. [Doctoral Dissertation]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31843

28. Wilczynski, Anaëlle. Interaction entre agents modélisée par un réseau social dans des problématiques de choix social computationnel : Interaction among agents via a social network in computational social choice.

Degree: Docteur es, Informatique, 2018, Paris Sciences et Lettres

Le choix social repose sur l’étude de la prise de décision collective, où un ensemble d’individus doit convenir d’une solution commune en fonction des préférences… (more)

Subjects/Keywords: Choix social computationnel; Réseau social; Vote stratégique; Allocation de ressources; Théorie des jeux algoritmique; Complexité; Computational social choice; Social network; Strategic voting; Resource allocation; Algorithmic Game Theory; Computational complexit; 003.56

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wilczynski, A. (2018). Interaction entre agents modélisée par un réseau social dans des problématiques de choix social computationnel : Interaction among agents via a social network in computational social choice. (Doctoral Dissertation). Paris Sciences et Lettres. Retrieved from http://www.theses.fr/2018PSLED073

Chicago Manual of Style (16th Edition):

Wilczynski, Anaëlle. “Interaction entre agents modélisée par un réseau social dans des problématiques de choix social computationnel : Interaction among agents via a social network in computational social choice.” 2018. Doctoral Dissertation, Paris Sciences et Lettres. Accessed September 24, 2020. http://www.theses.fr/2018PSLED073.

MLA Handbook (7th Edition):

Wilczynski, Anaëlle. “Interaction entre agents modélisée par un réseau social dans des problématiques de choix social computationnel : Interaction among agents via a social network in computational social choice.” 2018. Web. 24 Sep 2020.

Vancouver:

Wilczynski A. Interaction entre agents modélisée par un réseau social dans des problématiques de choix social computationnel : Interaction among agents via a social network in computational social choice. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres; 2018. [cited 2020 Sep 24]. Available from: http://www.theses.fr/2018PSLED073.

Council of Science Editors:

Wilczynski A. Interaction entre agents modélisée par un réseau social dans des problématiques de choix social computationnel : Interaction among agents via a social network in computational social choice. [Doctoral Dissertation]. Paris Sciences et Lettres; 2018. Available from: http://www.theses.fr/2018PSLED073


University of Edinburgh

29. Niblett, Timothy B. Validation of machine-oriented strategies in chess endgames.

Degree: PhD, 1982, University of Edinburgh

 This thesis is concerned with the validation of chess endgame strategies. It is also concerned with the synthesis of strategies that can be validated. A… (more)

Subjects/Keywords: 330; chess endgame strategies. : game theory models : logic programming : domain knowledge : algorithmic programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Niblett, T. B. (1982). Validation of machine-oriented strategies in chess endgames. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/6635

Chicago Manual of Style (16th Edition):

Niblett, Timothy B. “Validation of machine-oriented strategies in chess endgames.” 1982. Doctoral Dissertation, University of Edinburgh. Accessed September 24, 2020. http://hdl.handle.net/1842/6635.

MLA Handbook (7th Edition):

Niblett, Timothy B. “Validation of machine-oriented strategies in chess endgames.” 1982. Web. 24 Sep 2020.

Vancouver:

Niblett TB. Validation of machine-oriented strategies in chess endgames. [Internet] [Doctoral dissertation]. University of Edinburgh; 1982. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1842/6635.

Council of Science Editors:

Niblett TB. Validation of machine-oriented strategies in chess endgames. [Doctoral Dissertation]. University of Edinburgh; 1982. Available from: http://hdl.handle.net/1842/6635


University of Victoria

30. Scott, Allan Edward Jolicoeur. On the parameterized complexity of finding short winning strategies in combinatorial games.

Degree: Dept. of Computer Science, 2010, University of Victoria

 A combinatorial game is a game in which all players have perfect information and there is no element of chance; some well-known examples include othello,… (more)

Subjects/Keywords: computational complexity; combinatorial game theory; parameterized complexity; algorithmic combinatorial game theory; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Scott, A. E. J. (2010). On the parameterized complexity of finding short winning strategies in combinatorial games. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2676

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

Scott, Allan Edward Jolicoeur. “On the parameterized complexity of finding short winning strategies in combinatorial games.” 2010. Thesis, University of Victoria. Accessed September 24, 2020. http://hdl.handle.net/1828/2676.

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

MLA Handbook (7th Edition):

Scott, Allan Edward Jolicoeur. “On the parameterized complexity of finding short winning strategies in combinatorial games.” 2010. Web. 24 Sep 2020.

Vancouver:

Scott AEJ. On the parameterized complexity of finding short winning strategies in combinatorial games. [Internet] [Thesis]. University of Victoria; 2010. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1828/2676.

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

Council of Science Editors:

Scott AEJ. On the parameterized complexity of finding short winning strategies in combinatorial games. [Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2676

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

[1] [2]

.