( en | de | ru )

 

Disambiguation of "Melissourgos, Themistoklis"

Author of the publication

copydeleteadd this publication to your clipboard
Pizza Sharing Is PPA-Hard.

, , and . AAAI, page 4957-4965. AAAI Press, (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. You can also use the button next to the name to display some publications already assigned to the person.

Themistoklis Tsiotikas

Themistoklis Mylonas

Themistoklis Adamopoulos

Themistoklis Dimopoulos

Themistoklis Posukidis

 

Other publications of authors with the same name

Pure-Circuit: Strong Inapproximability for PPAD., , , and . FOCS, page 159-170. IEEE, (2022)Square-Cut Pizza Sharing is PPA-complete., , and . CoRR, (2020)Walrasian Equilibria in Markets with Small Demands., , and . AAMAS, page 413-419. ACM, (2021)Tight Inapproximability for Graphical Games., , , and . CoRR, (2022)An extension of the Moran process using type-specific connection graphs., , , and . J. Comput. Syst. Sci., (2022)Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback., , and . SAGT, volume 11059 of Lecture Notes in Computer Science, page 245-250. Springer, (2018)Connected Subgraph Defense Games., , , and . SAGT, volume 11801 of Lecture Notes in Computer Science, page 216-236. Springer, (2019)Mutants and Residents with Different Connection Graphs in the Moran Process., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 790-804. Springer, (2018)Optimization of Trading Strategies Using a Genetic Algorithm Under the Directional Changes Paradigm with Multiple Thresholds., , and . CEC, page 1-8. IEEE, (2023)Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values., and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 418-429. (2017)