( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Learning Approximately Optimal Contracts.

, , и . SAGT, том 13584 из Lecture Notes in Computer Science, стр. 331-346. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Argyrios Mavros

Argyrios Chronopoulos

Argyrios Kasioptas

Argyrios Stringaris

Theodor Argyrios Tsatsas

 

Другие публикации лиц с тем же именем

Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games.. University of Liverpool, UK, (2016)British Library, EThOS.Directed Graph Minors and Serial-Parallel Width., и . MFCS, том 117 из LIPIcs, стр. 44:1-44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Optimizing Reachability Sets in Temporal Graphs by Delaying., и . AAAI, стр. 9810-9817. AAAI Press, (2020)Minimizing Reachability Times on Temporal Graphs via Shifting Labels., , и . IJCAI, стр. 5333-5340. ijcai.org, (2023)Heterogeneous Facility Location Games., и . AAMAS, стр. 623-631. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem., , , и . ICALP, том 132 из LIPIcs, стр. 138:1-138:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Constant inapproximability for PPA., , , и . STOC, стр. 1010-1023. ACM, (2022)The Parameterized Complexity of Connected Fair Division., , , , и . IJCAI, стр. 139-145. ijcai.org, (2021)Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents., , и . CoRR, (2020)Tight Inapproximability for Graphical Games., , , и . AAAI, стр. 5600-5607. AAAI Press, (2023)