Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Algorithmic game theory)`

.
Showing records 1 – 30 of
34 total matches.

▼ Search Limiters

Cornell University

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

Degree: PhD, Computer Science, 2013, Cornell University

URL: http://hdl.handle.net/1813/34358

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Oren, Sigal. “An Algorithmic Approach To Analyzing Social Phenomena.” 2013. Web. 12 Apr 2021.

Vancouver:

Oren S. An Algorithmic Approach To Analyzing Social Phenomena. [Internet] [Doctoral dissertation]. Cornell University; 2013. [cited 2021 Apr 12]. 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 Waterloo

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

Degree: 2020, University of Waterloo

URL: http://hdl.handle.net/10012/16052

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Tofigzade, Natig. “An Algorithm for Stable Matching with Approximation up to the Integrality Gap.” 2020. Thesis, University of Waterloo. Accessed April 12, 2021. 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 (7^{th} Edition):

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

Vancouver:

Tofigzade N. An Algorithm for Stable Matching with Approximation up to the Integrality Gap. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Apr 12]. 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

Not specified: Masters Thesis or Doctoral Dissertation

3. Skoulakis, Efstratios - Panteleimon. Natural and efficient dynamics through convex optimization.

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

URL: http://hdl.handle.net/10442/hedi/46365

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

Skoulakis, E. -. P. (2019). Natural and efficient dynamics through convex optimization. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/46365

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Skoulakis, Efstratios - Panteleimon. “Natural and efficient dynamics through convex optimization.” 2019. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed April 12, 2021. http://hdl.handle.net/10442/hedi/46365.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Skoulakis, Efstratios - Panteleimon. “Natural and efficient dynamics through convex optimization.” 2019. Web. 12 Apr 2021.

Vancouver:

Skoulakis E-P. Natural and efficient dynamics through convex optimization. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2019. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/10442/hedi/46365.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Skoulakis E-P. Natural and efficient dynamics through convex optimization. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2019. Available from: http://hdl.handle.net/10442/hedi/46365

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

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

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

URL: http://hdl.handle.net/2142/97760

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lee, Wei-Chun. “On resource distribution in network coordination game.” 2017. Web. 12 Apr 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Temple University

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

Degree: PhD, 2009, Temple University

URL: http://digital.library.temple.edu/u?/p245801coll10,41030

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Delgado, Lisa A. “Matching Market for Skills.” 2009. Web. 12 Apr 2021.

Vancouver:

Delgado LA. Matching Market for Skills. [Internet] [Doctoral dissertation]. Temple University; 2009. [cited 2021 Apr 12]. 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

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

Degree: PhD, 2020, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:6331464c-c483-48b8-b030-58e431047614 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804309

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Najib, Muhammad. “Rational verification in multi-agent systems.” 2020. Doctoral Dissertation, University of Oxford. Accessed April 12, 2021. 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 (7^{th} Edition):

Najib, Muhammad. “Rational verification in multi-agent systems.” 2020. Web. 12 Apr 2021.

Vancouver:

Najib M. Rational verification in multi-agent systems. [Internet] [Doctoral dissertation]. University of Oxford; 2020. [cited 2021 Apr 12]. 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

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

Degree: 2007, Technische Universität Dortmund

URL: http://hdl.handle.net/2003/24877

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Web. 12 Apr 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

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

Degree: PhD, 2017, University of Toronto

URL: http://hdl.handle.net/1807/80643

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Drummond, Joanna. “Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges.” 2017. Web. 12 Apr 2021.

Vancouver:

Drummond J. Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2021 Apr 12]. 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

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

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

URL: http://hdl.handle.net/10442/hedi/36211

►

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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

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

Degree: PhD, Computer Science, 2017, Cornell University

URL: http://hdl.handle.net/1813/56874

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Niazadeh, Rad. “Algorithms vs. Mechanisms: Mechanism Design for Complex Environments.” 2017. Web. 12 Apr 2021.

Vancouver:

Niazadeh R. Algorithms vs. Mechanisms: Mechanism Design for Complex Environments. [Internet] [Doctoral dissertation]. Cornell University; 2017. [cited 2021 Apr 12]. 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

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

Degree: PhD, 2019, University of Toronto

URL: http://hdl.handle.net/1807/95757

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Casgrain, Philippe. “Algorithmic Trading with Latent Models and Mean-Field Games.” 2019. Web. 12 Apr 2021.

Vancouver:

Casgrain P. Algorithmic Trading with Latent Models and Mean-Field Games. [Internet] [Doctoral dissertation]. University of Toronto; 2019. [cited 2021 Apr 12]. 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

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

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

URL: http://hdl.handle.net/2142/97391

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gordon, Spencer L. “The complexity of continuous local search.” 2017. Web. 12 Apr 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

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

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

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/175580/rec/1541

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Salek, Mahyar. “Computational and economic aspects of procurement and sale.” 2011. Web. 12 Apr 2021.

Vancouver:

Salek M. Computational and economic aspects of procurement and sale. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Apr 12]. 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

Duke University

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

Degree: 2020, Duke University

URL: http://hdl.handle.net/10161/20862

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Deng, Yuan. “Dynamic Mechanism Design in Complex Environments .” 2020. Web. 12 Apr 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

URL: http://hdl.handle.net/10442/hedi/45484

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} 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 April 12, 2021. http://hdl.handle.net/10442/hedi/45484.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

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 2021 Apr 12]. Available from: http://hdl.handle.net/10442/hedi/45484.

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

URL: http://hdl.handle.net/10442/hedi/41712

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Amanatidis, Georgios. “Algorithmic and mechanism design aspects of problems with limited -or no - payments.” 2017. Web. 12 Apr 2021.

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 2021 Apr 12]. Available from: http://hdl.handle.net/10442/hedi/41712.

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

URL: http://hdl.handle.net/10442/hedi/37381

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Koutsiamanis, Remous - Aris. “Distributed management of competitive access to common resources using algorithmic game theory.” 2016. Web. 12 Apr 2021.

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 2021 Apr 12]. Available from: http://hdl.handle.net/10442/hedi/37381.

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

Not specified: Masters Thesis or Doctoral Dissertation

18. 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

URL: http://www.theses.fr/2014PEST1096

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} 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 12, 2021. http://www.theses.fr/2014PEST1096.

MLA Handbook (7^{th} Edition):

Pradeau, Thomas. “Congestion games with player-specific cost functions : Jeux de congestion avec fonctions de coût spécifiques à chaque joueur.” 2014. Web. 12 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 12]. 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

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

Degree: 2007, Technische Universität Dortmund

URL: http://dx.doi.org/10.17877/DE290R-483

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Web. 12 Apr 2021.

Vancouver:

Briest P. Computational aspects of combinatorial pricing problems. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2007. [cited 2021 Apr 12]. 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

20. 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 (ComUE)

URL: http://www.theses.fr/2018PSLED073

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (ComUE). Retrieved from http://www.theses.fr/2018PSLED073

Chicago Manual of Style (16^{th} 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 (ComUE). Accessed April 12, 2021. http://www.theses.fr/2018PSLED073.

MLA Handbook (7^{th} 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. 12 Apr 2021.

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 (ComUE); 2018. [cited 2021 Apr 12]. 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 (ComUE); 2018. Available from: http://www.theses.fr/2018PSLED073

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

Degree: 2011, University of Toronto

URL: http://hdl.handle.net/1807/31843

►

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

…*game* *theory* literature.
24
Chapter 2. Background
Single-Parameter Combinatorial Auctions… …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… …incentives is crucial to developing a *theory* of large-scale systems that interact directly
with… …human users. The area of research that addresses this intersection is known as
*algorithmic*…

Record Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Lucier, Brendan. “The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information.” 2011. Web. 12 Apr 2021.

Vancouver:

Lucier B. The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information. [Internet] [Doctoral dissertation]. University of Toronto; 2011. [cited 2021 Apr 12]. 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

University of Edinburgh

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

Degree: PhD, 1982, University of Edinburgh

URL: http://hdl.handle.net/1842/6635

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Niblett, Timothy B. “Validation of machine-oriented strategies in chess endgames.” 1982. Web. 12 Apr 2021.

Vancouver:

Niblett TB. Validation of machine-oriented strategies in chess endgames. [Internet] [Doctoral dissertation]. University of Edinburgh; 1982. [cited 2021 Apr 12]. 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

23. 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

URL: http://www.theses.fr/2016PA066148

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} 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 April 12, 2021. http://www.theses.fr/2016PA066148.

MLA Handbook (7^{th} 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. 12 Apr 2021.

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 2021 Apr 12]. 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

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

Degree: 2014, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-25022014-112039/

►

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: Algoritmo de Aproximação; Leilão; Otimização Combinatória; Precificação; Programação Inteira; Teoria dos Jogos Algorítmica; Algorithmic Game Theory; Approximation Algorithm; Auction; Combinatorial Optimization; Integer Programming; Pricing

Record Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Schouery, Rafael Crivellari Saliba. “Problemas de alocação e precificação de itens.” 2014. Web. 12 Apr 2021.

Vancouver:

Schouery RCS. Problemas de alocação e precificação de itens. [Internet] [Doctoral dissertation]. University of São Paulo; 2014. [cited 2021 Apr 12]. 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/

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

Degree: 2012, Brazil

URL: http://hdl.handle.net/10183/54866

►

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; Algoritmos; Teoria : Jogos; Algorithmic game theory; Smoothed analysis; Lemke-Howson algorithm; Bimatrix games; Frank-Wolfe algorithm; Network games; Traffic assignment problem; Price of anarchy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

Rodrigues, Félix Carvalho. “Smoothed analysis in Nash equilibria and the Price of Anarchy.” 2012. Masters Thesis, Brazil. Accessed April 12, 2021. http://hdl.handle.net/10183/54866.

MLA Handbook (7^{th} Edition):

Rodrigues, Félix Carvalho. “Smoothed analysis in Nash equilibria and the Price of Anarchy.” 2012. Web. 12 Apr 2021.

Vancouver:

Rodrigues FC. Smoothed analysis in Nash equilibria and the Price of Anarchy. [Internet] [Masters thesis]. Brazil; 2012. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/10183/54866.

Council of Science Editors:

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

University of Victoria

26. 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

URL: http://hdl.handle.net/1828/2676

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Scott, Allan Edward Jolicoeur. “On the parameterized complexity of finding short winning strategies in combinatorial games.” 2010. Web. 12 Apr 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

27. Jalaly Khalilabadi, Pooya. Fairness, Learning and Efficiency in Markets with Budgeted Agents.

Degree: PhD, Computer Science, 2018, Cornell University

URL: http://hdl.handle.net/1813/59355

► In almost all online markets with monetary transactions, the participants have a limited budget which restricts their ability to purchase their desired commodities. Models from…
(more)

Subjects/Keywords: Ad Auctions; Budgeted Agents; Mechanism Design; Online Markets; Computer science; Algorithmic Game Theory

…introduced me to *Algorithmic* *Game* *Theory* and Computer
Science during my undergraduate studies. I… …interdisciplinary work between computer scientists and
economists, the place where *algorithmic* *game* *theory*… …Yang Yuan in the *Theory* of Computing lab during my time as a graduate student at Cornell… …*Theory* of Computing at Berkeley University of California in Fall 2015.
vi
TABLE OF CONTENTS… …strategic human who can lie about his/her required payment. *Algorithmic* mechanism design tries to…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jalaly Khalilabadi, P. (2018). Fairness, Learning and Efficiency in Markets with Budgeted Agents. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/59355

Chicago Manual of Style (16^{th} Edition):

Jalaly Khalilabadi, Pooya. “Fairness, Learning and Efficiency in Markets with Budgeted Agents.” 2018. Doctoral Dissertation, Cornell University. Accessed April 12, 2021. http://hdl.handle.net/1813/59355.

MLA Handbook (7^{th} Edition):

Jalaly Khalilabadi, Pooya. “Fairness, Learning and Efficiency in Markets with Budgeted Agents.” 2018. Web. 12 Apr 2021.

Vancouver:

Jalaly Khalilabadi P. Fairness, Learning and Efficiency in Markets with Budgeted Agents. [Internet] [Doctoral dissertation]. Cornell University; 2018. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/1813/59355.

Council of Science Editors:

Jalaly Khalilabadi P. Fairness, Learning and Efficiency in Markets with Budgeted Agents. [Doctoral Dissertation]. Cornell University; 2018. Available from: http://hdl.handle.net/1813/59355

28. Βιδάλη, Αγγελίνα. Παιγνιοθεωρητική ανάλυση δικτύων.

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

URL: http://hdl.handle.net/10442/hedi/23970

►

*Algorithmic* mechanism design is an important area between computer science and economics. One of the most fundamental problems in this area is the problem of…
(more)

Subjects/Keywords: Αλγοριθμική θεωρία παιγνίων; Σχεδίαση μηχανισμών; Κάτω φράγμα; Προσεγγιστικός αλγόριθμος; Χαρακτηρισμοί; Algorithmic game theory; Mechanism design; Lower bound; Approximation algorithms; Characterizations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Βιδάλη, Αγγελίνα. “Παιγνιοθεωρητική ανάλυση δικτύων.” 2009. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed April 12, 2021. http://hdl.handle.net/10442/hedi/23970.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Βιδάλη, Αγγελίνα. “Παιγνιοθεωρητική ανάλυση δικτύων.” 2009. Web. 12 Apr 2021.

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

29. LIANG KE. Peer-to-peer interactive 3D media dissemination in networked virtual environments.

Degree: 2011, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/33330

Subjects/Keywords: Peer-to-peer; media streaming; distributed algorithms; algorithmic game theory; spatial audio; 3D texture

Record Details Similar Records

❌

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

APA (6^{th} Edition):

KE, L. (2011). Peer-to-peer interactive 3D media dissemination in networked virtual environments. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/33330

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

KE, LIANG. “Peer-to-peer interactive 3D media dissemination in networked virtual environments.” 2011. Thesis, National University of Singapore. Accessed April 12, 2021. http://scholarbank.nus.edu.sg/handle/10635/33330.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

KE, LIANG. “Peer-to-peer interactive 3D media dissemination in networked virtual environments.” 2011. Web. 12 Apr 2021.

Vancouver:

KE L. Peer-to-peer interactive 3D media dissemination in networked virtual environments. [Internet] [Thesis]. National University of Singapore; 2011. [cited 2021 Apr 12]. Available from: http://scholarbank.nus.edu.sg/handle/10635/33330.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

KE L. Peer-to-peer interactive 3D media dissemination in networked virtual environments. [Thesis]. National University of Singapore; 2011. Available from: http://scholarbank.nus.edu.sg/handle/10635/33330

Not specified: Masters Thesis or Doctoral Dissertation

Lehigh University

30. DeNegre, Scott. Interdiction and Discrete Bilevel Linear Programming.

Degree: PhD, Industrial Engineering, 2011, Lehigh University

URL: https://preserve.lehigh.edu/etd/1226

Subjects/Keywords: Algorithmic Game Theory; Bilevel Programming; Comptutational Optimization; Integer Programming; Engineering; Industrial Engineering; Operations Research, Systems Engineering and Industrial Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

DeNegre, S. (2011). Interdiction and Discrete Bilevel Linear Programming. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/1226

Chicago Manual of Style (16^{th} Edition):

DeNegre, Scott. “Interdiction and Discrete Bilevel Linear Programming.” 2011. Doctoral Dissertation, Lehigh University. Accessed April 12, 2021. https://preserve.lehigh.edu/etd/1226.

MLA Handbook (7^{th} Edition):

DeNegre, Scott. “Interdiction and Discrete Bilevel Linear Programming.” 2011. Web. 12 Apr 2021.

Vancouver:

DeNegre S. Interdiction and Discrete Bilevel Linear Programming. [Internet] [Doctoral dissertation]. Lehigh University; 2011. [cited 2021 Apr 12]. Available from: https://preserve.lehigh.edu/etd/1226.

Council of Science Editors:

DeNegre S. Interdiction and Discrete Bilevel Linear Programming. [Doctoral Dissertation]. Lehigh University; 2011. Available from: https://preserve.lehigh.edu/etd/1226