Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Theory of computation → Solution concepts in game theory"'
Strategy iteration is a technique frequently used for two-player games in order to determine the winner or compute payoffs, but to the best of our knowledge no general framework for strategy iteration has been considered. Inspired by previous work on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30ea09d51c42228292f653c40c7855f7
https://hdl.handle.net/11577/3474660
https://hdl.handle.net/11577/3474660
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c19753a37740f965274159d7f92b57a5
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee4feba6a7425c51d63f41832c606963
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
Autor:
Avni, Guy, Sadhukhan, Suman
In a two-player zero-sum graph game, the players move a token throughout the graph to produce an infinite play, which determines the winner of the game. \emph{Bidding games} are graph games in which in each turn, an auction (bidding) determines which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::333046b326c8cd9b155e2468db0addcf
Publikováno v:
Leibniz International Proceedings in Informatics
FSTTCS 2022-42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS 2022-42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2022, Chennai, France. pp.1-20, ⟨10.4230/LIPIcs.FSTTCS.2022.32⟩
FSTTCS 2022-42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS 2022-42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2022, Chennai, France. pp.1-20, ⟨10.4230/LIPIcs.FSTTCS.2022.32⟩
We consider atomic congestion games on series-parallel networks, and study the structure of the sets of Nash equilibria and social local optima on a given network when the number of players varies. We establish that these sets are definable in Presbu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39d5a1dfb10a4a6d3fff7472b2799b95
Autor:
Daskalakis, Constantinos
Machine Learning has recently made significant advances in challenges such as speech and image recognition, automatic translation, and text generation, much of that progress being fueled by the success of gradient descent-based optimization methods i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1decda3d2550fcf98f31e5c94aeb4b7a
Autor:
Chen, Jiehua, Roy, Sanjukta
We investigate the Euclidean 𝖽-Dimensional Stable Roommates problem, which asks whether a given set V of 𝖽⋅ n points from the 2-dimensional Euclidean space can be partitioned into n disjoint (unordered) subsets Π = {V₁,…,V_{n}} with |V_i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f3bfd474dfc7f4895b7213898d2b86a
Autor:
Avni, Guy, Henzinger, Thomas A.
A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a70f207fcdba778ae765ac4e161f6f6f
We study the rational verification problem which consists in verifying the correctness of a system executing in an environment that is assumed to behave rationally. We consider the model of rationality in which the environment only executes behaviors
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1300c1949b17e305141ca7ee95247d40
Publikováno v:
CSL'22
CSL'22, Feb 2022, on line, Germany. ⟨10.4230/LIPIcs.CSL.2022.7⟩
CSL'22, Feb 2022, on line, Germany. ⟨10.4230/LIPIcs.CSL.2022.7⟩
We study two-player reachability games on finite graphs. At each state the interaction between the players is concurrent and there is a stochastic Nature. Players also play stochastically. The literature tells us that 1) Player ����, who want
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b6264db7d700494ac95256bfa5f9371
http://arxiv.org/abs/2110.14724
http://arxiv.org/abs/2110.14724