Suchergebnisse - "Algorithmic game theory and complexity"

Pure-Circuit: Tight Inapproximability for PPAD: Pure-circuit: tight inapproximability for PPAD

Autoren: Argyrios Deligkas John Fearnley Alexandros Hollender et al.

Quelle: Journal of the ACM. 71:1-48

Schlagwörter: 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)

Dateibeschreibung: application/xml; text

Zugangs-URL: http://arxiv.org/abs/2209.15149
https://zbmath.org/8030798
https://doi.org/10.1145/3678166
https://ora.ox.ac.uk/objects/uuid:8caf995a-0aed-433b-95e5-be143d8e8007
https://doi.org/10.1145/3678166

Computing Threshold Budgets in Discrete-Bidding Games: Computing threshold budgets in discrete-bidding games

Autoren: Avni, Guy Sadhukhan, Suman Guy Avni and Suman Sadhukhan

Weitere Verfasser: Avni, Guy Sadhukhan, Suman Guy Avni and Suman Sadhukhan

Quelle: TheoretiCS. 4

Schlagwörter: 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)

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://arxiv.org/abs/2210.02773
https://zbmath.org/8005289
https://doi.org/10.46298/theoretics.25.5
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.30

Algorithmic Contract Theory: A Survey: Algorithmic contract theory: a survey

Autoren: Dütting, Paul Feldman, Michal Talgam-Cohen, Inbal

Quelle: Foundations and Trends® in Theoretical Computer Science

Schlagwörter: 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)

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2412.16384
https://zbmath.org/7975758
https://doi.org/10.1561/0400000113

Arena-Independent Finite-Memory Determinacy in Stochastic Games: Arena-independent finite-memory determinacy in stochastic games

Autoren: Bouyer, Patricia Oualhadj, Youssouf Randour, Mickael et al.

Weitere Verfasser: Bouyer, Patricia Oualhadj, Youssouf Randour, Mickael et al.

Quelle: Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)

Schlagwörter: 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)

Dateibeschreibung: application/pdf; application/xml

Zugangs-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

On‐line balancing of random inputs: On-line balancing of random inputs

Autoren: Nikhil Bansal Joel Spencer

Quelle: Random Structures & Algorithms. 57:879-891

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Heuristic solutions for interval-valued games

Autoren: R.K. Gupta D. Khan

Quelle: Iranian Journal of Numerical Analysis and Optimization, Vol 12, Iss 1, Pp 187-200 (2022)

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://doaj.org/article/0aac8a66615d40e08f4dcf43c8f47434

Envy-Free Cake-Cutting for Four Agents.

Autoren: Hollender, Alexandros Rubinstein, Aviad

Quelle: Journal of the ACM; Oct2025, Vol. 72 Issue 5, p1-54, 54p

Schlagwörter: COMPUTATIONAL complexity, COMMUNICATION complexity (Information theory), HEURISTIC, ALGORITHMS, RESOURCE allocation, FAIRNESS

Combinatorial Algorithms

Autoren: Sun-Yuan Hsieh Ling-Ju Hung Chia-Wei Lee

Resource Type: eBook.

Schlagworte: Computer science—Mathematics, Discrete mathematics, Computer engineering, Computer networks, Algorithms, Data structures (Computer science), Information theory, Computer graphics, Numerical analysis

Categories: COMPUTERS / Computer Science, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis

Combinatorial Algorithms : 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings

Autoren: Cristina Bazgan Henning Fernau

Resource Type: eBook.

Schlagworte: Computer science—Mathematics, Discrete mathematics, Computer engineering, Computer networks, Algorithms, Data structures (Computer science), Information theory, Computer graphics, Numerical analysis

Categories: COMPUTERS / Computer Science, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis

Study on Agent Incentives for Resource Sharing on P2P Networks.

Autoren: Cheng, Yukun Deng, Xiaotie Li, Yuhao

Quelle: Asia-Pacific Journal of Operational Research; Jun2022, Vol. 39 Issue 3, p1-27, 27p

Schlagwörter: PEER-to-peer file sharing, UTILITY functions, SHARING

Coordination of a two-level supply chain with contracts.

Autoren: Phouratsamay, Siao-Leu Kedad-Sidhoum, Safia Pascual, Fanny

Quelle: 4OR (1619-4500); Jun2021, Vol. 19 Issue 2, p235-264, 30p

Weighted Matching Markets with Budget Constraints.

Autoren: Ismaili, Anisse Naoto Hamada Yuzhe Zhang et al.

Quelle: Journal of Artificial Intelligence Research; 2019, Vol. 65, p393-421, 29p

Schlagwörter: STATISTICAL matching, WAGES, BUDGET, CONSTRAINT satisfaction, PARETO analysis

Towards the Computation of a Nash Equilibrium.

Autoren: Lu, Yu He, Ying

Quelle: Advances in Neural Networks - ISNN 2014; 2014, p90-99, 10p

Algorithmic Game Theory and Applications.

Autoren: Nayak, Amiya Stojmenović, Ivan

Quelle: Handbook of Applied Algorithms; 2008, p287-315, 29p

SPECIAL SECTION ON FOUNDATIONS OF COMPUTER SCIENCE.

Autoren: Lee, James R. Umans, Chris

Quelle: SIAM Journal on Computing. 2010, Vol. 39 Issue 6, p2397-2397. 1p.

Schlagwörter: *COMPUTER science, *ALGORITHMS

Smart Grid Network Optimization: Data-Quality-Aware Volume Reduction.

Autoren: Allalouf, Miriam Gershinsky, Gidon Lewin-Eytan, Liane et al.

Quelle: IEEE Systems Journal; Jun2014, Vol. 8 Issue 2, p450-460, 11p

Tradeoff lower lounds for stack machines.

Autoren: David, Matei Papakonstantinou, Periklis

Quelle: Computational Complexity; Mar2014, Vol. 23 Issue 1, p99-146, 48p

Schlagwörter: COMMUNICATION complexity (Information theory), TURING machines, MACHINE theory, LOGARITHMIC functions, POLYNOMIAL time algorithms, COMPUTER network protocols

Dynamic Power Allocation Under Arbitrary Varying Channels—An Online Approach.

Autoren: Buchbinder, Niv Lewin-Eytan, Liane Menache, Ishai et al.

Quelle: IEEE/ACM Transactions on Networking; Apr2012, Vol. 20 Issue 2, p477-487, 11p

Schlagwörter: WIRELESS communications, BANDWIDTHS, ALGORITHMS, DATA transmission systems, DIGITAL communications, ONLINE data processing

Non-Cooperative Multicast and Facility Location Games.

Autoren: Chekuri, Chandra Chuzhoy, Julia Lewin-Eytan, Liane et al.

Quelle: IEEE Journal on Selected Areas in Communications; Aug2007, Vol. 25 Issue 6, p1193-1206, 14p, 5 Diagrams, 2 Graphs

Schlagwörter: GAME theory, NONCOOPERATIVE games (Mathematics), NASH equilibrium, COST shifting, COMPUTER users, ROUTING (Computer network management), COMPUTER network management, ALGORITHMS

On Iterated Dominance, Matrix Elimination, and Matched Paths

Autoren: Brandt, Felix Fischer, Felix Holzer, Markus

Index Begriffe: Algorithmic Game Theory, Computational Complexity, Iterated Dominance, Matching, Data processing Computer science, InProceedings, publishedVersion