Search Results - "Algorithmic game theory and complexity"
-
1
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
-
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:
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
-
4
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 -
5
Authors:
Source: Random Structures & Algorithms. 57:879-891
Subject Terms: FOS: Computer and information sciences, online algorithms, Discrete Mathematics (cs.DM), Probability (math.PR), 0102 computer and information sciences, 01 natural sciences, random vectors, Computer Science - Data Structures and Algorithms, discrepancy, FOS: Mathematics, Online algorithms, streaming algorithms, Data Structures and Algorithms (cs.DS), 0101 mathematics, Algorithmic game theory and complexity, Mathematics - Probability, Computer Science - Discrete Mathematics
File Description: application/xml
Access URL: https://ir.cwi.nl/pub/30093/rsa.20955.pdf
http://arxiv.org/abs/1903.06898
https://zbmath.org/7290193
https://doi.org/10.1002/rsa.20955
https://research.tue.nl/en/publications/5794e854-aea9-4e5d-aa61-057c79437aca
https://doi.org/10.1002/rsa.20955
http://dblp.uni-trier.de/db/journals/corr/corr1903.html#abs-1903-06898
https://dblp.uni-trier.de/db/journals/corr/corr1903.html#abs-1903-06898
http://doi.org/10.1002/rsa.20955
https://ir.cwi.nl/pub/30093
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A30093
https://onlinelibrary.wiley.com/doi/10.1002/rsa.20955 -
6
Authors:
Source: Iranian Journal of Numerical Analysis and Optimization, Vol 12, Iss 1, Pp 187-200 (2022)
Subject Terms: Noncooperative games, order relations, T57-57.97, Applied mathematics. Quantitative methods, genetic algorithm, two persons zero sum game, Algorithmic game theory and complexity, 2-person games, two-person zero-sum game, interval-valued payoffs
File Description: application/xml
-
7
Full Text Finder 
Nájsť tento článok vo Web of Science