Search Results - Algorithmic game theory and complexity
-
1
Authors:
Source: Foundations and Trends® in Theoretical Computer Science
Subject Terms: FOS: Computer and information sciences, Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance, online learning, design and analysis of algorithms, algorithmic game theory, economics of information and the web, FOS: Economics and business, Computer Science - Computer Science and Game Theory, Economics - Theoretical Economics, Contract theory (moral hazard, adverse selection), Theoretical Economics (econ.TH), classification and prediction, game-theoretic learning, Algorithmic game theory and complexity, operations research, Computer Science and Game Theory (cs.GT)
File Description: application/xml
-
2
Authors:
Contributors:
Source: TheoretiCS. 4
Subject Terms: Computer Science and Game Theory, FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), discrete bidding games, Richman games, 0102 computer and information sciences, 01 natural sciences, 2-person games, Noncooperative games, Auctions, bargaining, bidding and selling, and other market models, parity games, ddc:004, Games involving graphs, Algorithmic game theory and complexity, Formal Languages and Automata Theory, reachability games, Discrete bidding games, Computer Science and Game Theory (cs.GT)
File Description: application/xml; application/pdf
-
3
Authors: et al.
Source: Journal of the ACM. 71:1-48
Subject Terms: FOS: Computer and information sciences, TFNP, Networks and circuits as models of computation, circuit complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Approximation algorithms, Nash equilibrium, Computer Science - Computational Complexity, generalized circuit, Computer Science - Computer Science and Game Theory, 0202 electrical engineering, electronic engineering, information engineering, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), PPAD, Algorithmic game theory and complexity, approximation, Computer Science and Game Theory (cs.GT)
File Description: application/xml; text
-
4
Authors:
Resource Type: eBook.
Subjects: Computer simulation, Data structures (Computer science), Information theory, Application software, Artificial intelligence, Algorithms, Computer networks
Categories: COMPUTERS / Computer Simulation, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Business & Productivity Software / General, COMPUTERS / Computer Science, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Networking / General
-
5
Authors: et al.
Subject Terms: Computer Science and Game Theory, FOS: Computer and information sciences, Computational Complexity, Computational Complexity (cs.CC), F.2.0, Computer Science and Game Theory (cs.GT)
Access URL: http://arxiv.org/abs/2507.11509
-
6
Authors: et al.
Contributors: et al.
Source: 14th International Conference on Interactive Theorem Proving (ITP 2023)
https://hal.science/hal-04269882
14th International Conference on Interactive Theorem Proving (ITP 2023), Jul 2023, Bialystok, Poland. ⟨10.4230/LIPICS.ITP.2023.25⟩
https://drops.dagstuhl.de/opus/volltexte/2023/18400/Subject Terms: Game of Incomplete Information, Belief Function Theory, Coq Proof Assistant, SSReflect Proof Language, MathComp Library, Logic and verification, Type theory, Higher order logic, Algorithmic game theory, Solution concepts in game theory, Representations of games and their complexity, [INFO]Computer Science [cs]
Time: Bialystok, Poland
-
7
Authors: et al.
Contributors: et al.
Source: Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
Subject Terms: FOS: Computer and information sciences, finite-memory determinacy, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Logic, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], optimal strategies, 01 natural sciences, computer science - logic in computer science, Noncooperative games, Computer Science - Computer Science and Game Theory, 0202 electrical engineering, electronic engineering, information engineering, stochastic games, Games involving graphs, BC1-199, computer science - computer science and game theory, Markov and semi-Markov decision processes, Games on graphs (graph-theoretic aspects), QA75.5-76.95, 2-person games, Markov decision processes, Logic in Computer Science (cs.LO), computer science - formal languages and automata theory, Stochastic games, stochastic differential games, Electronic computers. Computer science, [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], ddc:004, Algorithmic game theory and complexity, two-player games on graphs, Computer Science and Game Theory (cs.GT)
File Description: application/pdf; application/xml
Access URL: http://arxiv.org/abs/2102.10104
https://zbmath.org/7788990
https://doi.org/10.46298/lmcs-19(4:18)2023
https://doaj.org/article/95a2799723e64aa5b931b8730bb0ee4e
https://hal.science/hal-03240080v1
https://doi.org/10.4230/lipics.concur.2021.26
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.26 -
8
Authors:
Source: Information & Computation. Nov2025, Vol. 307, pN.PAG-N.PAG. 1p.
Subject Terms: *NASH equilibrium, *GAME theory, *COMPUTATIONAL complexity, *CONSTRAINT programming, *GAMES, *RESEARCH methodology, *APPROXIMATION theory, *HEURISTIC algorithms
People: NASH, John F., 1928-2015
-
9
Authors: Riquelme Csori, Fabián
Contributors: University/Department: Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
Thesis Advisors: Serna, Maria José, Molinero Albareda, Xavier
Source: TDX (Tesis Doctorals en Xarxa)
Subject Terms: Game theory, Hypergraph, Computational complexity, Decisive problem, Duality problem, Power indices, Solution concepts, Spread of influence, Multi-agent systems, Mediation systems, Collective choice models, Social network analysis
File Description: application/pdf
-
10
Authors: et al.
Contributors: et al.
Source: Leibniz International Proceedings in Informatics (LIPIcs) ; International Conference on Fun with Algorithms (FUN) ; https://hal.science/hal-04543617 ; International Conference on Fun with Algorithms (FUN), Jun 2024, La Maddalena, Maddalena Islands, Italy. ⟨10.4230/LIPIcs.FUN.2024.2⟩
Subject Terms: Connect 4, Theory of computation → Algorithmic game theory, Game complexity, Maker-Breaker games, Positional games, Maker-Breaker, Poset, Positional game, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Subject Geographic: Italy
Time: La Maddalena, Maddalena Islands, Italy
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2404.07700; ARXIV: 2404.07700
-
11
Authors:
Contributors:
Source: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)Subject Terms: Classificació AMS::68 Computer science, Àrees temàtiques de la UPC::Matemàtiques i estadística, Computational Complexity, Teoria de, Grafs, Teoria de, Algorithmic Game Theory, Classificació AMS::05 Combinatorics::05C Graph theory, Intelligent Agents, Jocs, Computational complexity, Graph theory, Grafs, Game Theory, Combinatorics, Jocs, Teoria de, Economics and Computation, Graphs, Complexitat computacional, Game theory
File Description: application/pdf
Access URL: https://hdl.handle.net/2117/415905
-
12
-
13
-
14
Authors:
Contributors:
Source: Algorithmica. 77:836-866
Subject Terms: Price of Anarchy, matching, Complexity, 0102 computer and information sciences, [INFO] Computer Science [cs], Approximation algorithm, 01 natural sciences, Stackelberg strategy, price of optimum, Algorithmic game theory, Srategic game, Modèles mathématiques. Algorithmes, approximation algorithm, Price of optimum
Access URL: http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica77.html#EscoffierGM17
https://hal.archives-ouvertes.fr/hal-01483682
https://link.springer.com/article/10.1007/s00453-015-0108-5/fulltext.html
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica77.html#EscoffierGM17
http://hal.upmc.fr/hal-01483682
https://link.springer.com/article/10.1007/s00453-015-0108-5
https://hal.sorbonne-universite.fr/hal-01483682v1
https://doi.org/10.1007/s00453-015-0108-5 -
15
Authors:
Source: Intelligenza Artificiale. 2024, Vol. 18 Issue 2, p219-237. 19p.
Subject Terms: *TIME complexity, *NASH equilibrium, *STRATEGY games, *GAME theory, *COUNTERFACTUALS (Logic)
-
16
Authors:
Contributors:
Subject Terms: non-cooperative games, computational complexity, ddc:004, equilibrium
File Description: application/pdf
-
17
Authors: et al.
Contributors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783642046445
Subject Terms: FOS: Computer and information sciences, Computer Science - Artificial Intelligence, G.1.6, I.2.8, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, F.2.2, Computer Science - Computational Complexity, Artificial Intelligence (cs.AI), Computer Science - Computer Science and Game Theory, 0202 electrical engineering, electronic engineering, information engineering, Science::Mathematics [DRNTU], Computer Science and Game Theory (cs.GT)
File Description: application/pdf
Access URL: https://dr.ntu.edu.sg/bitstream/10356/94109/1/52.%20The%20Cost%20of%20Stability%20in%20Coalitional%20Games.pdf
http://arxiv.org/abs/0907.4385
https://www.microsoft.com/en-us/research/publication/the-cost-of-stability-and-its-application-to-weighted-voting-games /
https://link.springer.com/10.1007/978-3-642-04645-2
https://www.cs.ox.ac.uk/publications/publication7261-abstract.html
https://ui.adsabs.harvard.edu/abs/2009LNCS.5814.....M/abstract
https://research.microsoft.com/apps/pubs/default.aspx?id=81496
https://www.microsoft.com/en-us/research/wp-content/uploads/2009/01/sagt2009_submission_17.pdf
https://link.springer.com/chapter/10.1007/978-3-642-04645-2_12
https://dr.ntu.edu.sg/handle/10356/94109
https://dr.ntu.edu.sg/bitstream/10356/94109/1/52.%20The%20Cost%20of%20Stability%20in%20Coalitional%20Games.pdf
https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/CoS-SAGT-2009.pdf
https://research.microsoft.com/apps/pubs/default.aspx?id=118170
https://core.ac.uk/display/2069863
https://arxiv.org/pdf/0907.4385.pdf
https://arxiv.org/abs/0907.4385
https://hdl.handle.net/10356/94109
http://hdl.handle.net/10220/7628 -
18
Authors: et al.
Contributors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783540438649
29th International Colloquium on Automata, Languages, and Programming, ICALP 2002
Lect. Notes Comput. Sci.
Theoretical Computer Science
Theor.Comput.Sci.Subject Terms: Latency costs, selfish routing, Nash equilibria, Nash equilibrium, Theoretical Computer Science, Pure Nash equilibrium, Parallel links, Hardness, cost, Social cost, Hardness result, NP-hardness, Wireless telecommunication systems, Algorithmic problems, Game theory, Automata theory, Network congestions, Efficient algorithm, nash equilibrium, anarchy, model, Systematic study, Telecommunication networks, existence, algorithmic game theory, price, Costs, Computational complexity, Probability distributions, Mixed strategy, P-completeness, Algorithmic game theory, Combinatorial structures, Selfish routing, Random choice, Congestion control (communication), Algorithms, worst-case equilibria, Computer Science(all)
Access URL: https://link.springer.com/content/pdf/10.1007/3-540-45465-9_12.pdf
https://core.ac.uk/display/20675050
https://dblp.uni-trier.de/db/conf/icalp/icalp2002.html#FotakisKKMS02
http://pubman.mpdl.mpg.de/pubman/item/escidoc:1330445
https://link.springer.com/chapter/10.1007/3-540-45465-9_12
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1330445
http://olympias.lib.uoi.gr/jspui/handle/123456789/11003
https://ora.ox.ac.uk/objects/uuid:723e0154-67ae-44d2-9f89-2d28dc09ade0
https://ora.ox.ac.uk/objects/uuid:c57a86aa-da21-4c16-bf3c-efb67c5eff49
https://pergamos.lib.uoa.gr/uoa/dl/object/3064950
https://pergamos.lib.uoa.gr/uoa/dl/object/3066586
http://gnosis.library.ucy.ac.cy/handle/7/53948
http://gnosis.library.ucy.ac.cy/handle/7/53947 -
19
Authors: ROUGHGARDEN, TIM1 tim@cs.stanford.edu
Source: Communications of the ACM. Jul2010, Vol. 53 Issue 7, p78-86. 9p. 2 Illustrations, 1 Diagram, 1 Graph.
Subject Terms: *GAME theory, *ALGORITHMS, *INFORMATION networks, *NASH equilibrium, *AUCTIONS, *COMPUTER software, COMPUTATIONAL complexity
-
20
Authors:
Index Terms: Àrees temàtiques de la UPC::Matemàtiques i estadística, Game theory, Computational complexity, Graph theory, Game Theory, Computational Complexity, Economics and Computation, Algorithmic Game Theory, Intelligent Agents, Graphs, Combinatorics, Jocs, Teoria de, Complexitat computacional, Grafs, Teoria de, Classificació AMS::68 Computer science, Classificació AMS::05 Combinatorics::05C Graph theory, Master thesis
Nájsť tento článok vo Web of Science 
Full Text Finder