Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., Voudouris, A.A. (2020) Maximum Nash welfare and other stories about EFX.

In Bessiere, C. (Eds.), Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence: IJCAI-20 : Yokohama (pp 24-30). International Joint Conferences on Artificial Intelligence.

Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Voudouris, A.A. (2020) Peeking behind the ordinal curtain: Improving distortion via cardinal queries.

In AAAI-20, IAAI-20, EAAI-20 proceedings: Thirty-Fourth AAAI Conference on Artificial Intelligence, Thirty-Second Conference on Innovative Applications of Artificial Intelligence, The Tenth Symposium on Educational Advances in Artificial Intelligence : February 7–12th, 2020, New York Hilton Midto (pp 1782-1789) (Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34). AAAI Press.

Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Voudouris, A.A. (2021) A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching.

In AAAI-21, IAAI-21, EAAI-21 proceedings: a virtual conference, February 2-9, 2021 : Thirty-Fifth AAAI Conference on Artificial Intelligence, Thirty-Third Conference on Innovative Applications of Articicial Intelligence, Eleventh Symposium on Educational Advances in Artificial Intelligence (pp 5078-5085) (Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35). AAAI Press.

Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., Reiffenhäuser, R. (2023) Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria.

In EC 2023: Proceedings of the 24th ACM Conference on Economics and Computation) : July 9-12, 2023, London, United Kingdom (pp 67-87). Association for Computing Machinery.

Amanatidis, G., Birmpas, G., Markakis, E. (2020) A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint.

Information Processing Letters, Vol. 163

Article | https://doi.org/10.1016/j.ipl.2020.106010 | UvA-DARE

Amanatidis, G., Kleer, P., Schäfer, G. (2022) Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online.

Mathematics of operations research, Vol. 47 (pp 2286-2309)

Article | https://doi.org/10.1287/moor.2021.1208 | UvA-DARE

Amanatidis, G., Kleer, P. (2020) Rapid mixing of the switch Markov chain for strongly stable degree sequences.

Random Structures and Algorithms, Vol. 57 (pp 637-657)

Article | https://doi.org/10.1002/rsa.20949 | UvA-DARE

Amanatidis, G., Klumper, S., Markakis, E., Schäfer, G., Tsikiridis, A. (2024) Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents.

In Garg, J. Klimm, M. Kong, Y. (Eds.), Web and Internet Economics: 19th International Conference, WINE 2023, Shanghai, China, December 4–8, 2023 : proceedings (pp 41-58) (Lecture Notes in Computer Science
Advanced Research in Computing and Software Science, Vol. 14413). Springer.

Amanatidis, G., Markakis, E., Ntokos, A. (2020) Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination.

Theoretical Computer Science, Vol. 841 (pp 94-109)

Article | https://doi.org/10.1016/j.tcs.2020.07.006 | UvA-DARE

Amanatidis, G., Reiffenhäuser, R. (2024) Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.

Mathematics of operations research, Vol. 49 (pp 2049-2802)

Article | https://doi.org/10.1287/moor.2022.0058 | UvA-DARE

Amano, K., Vitanyi, P.M.B., Watanabe, O. (2000) On the length of the Monopolist Game.

Computing, Vol. 2000 (pp 41-48)

Article | UvA-DARE

Ambainis, A., Bačkurs, A., Smotrovs, J., de Wolf, R. (2013) Optimal quantum query bounds for almost all Boolean functions.

In Portier, N. Wilke, T. (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science: STACS '13, February 27th to March 2nd, 2013, Kiel, Germany (pp 446-453) (Leibniz International Proceedings in Informatics, Vol. 20). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Ambainis, A., Belovs, A., Regev, O., de Wolf, R. (2016) Efficient quantum algorithms for (gapped) group testing and junta testing.

In Krauthgamer, R. (Eds.), Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2016 : January 10-12, 2016, Crystal Gateway Marriott, Arlington, Virginia, USA (pp 903-922). Society for Industrial and Applied Mathematics.

Ambainis, A., Buhrman, H., Gasarch, W.I., Kalayanasundaram, B., Torenvliet, L. (2000) The communication complexity of enumeration, elimination and selection.

In Proceedings 15th IEEE Conference on Computational Complexity (pp 44-53)

Ambainis, A., Buhrman, H., Gasarch, W.I., Kalayanasundaram, B., Torenvliet, L. (2001) The communication complexity of enumeration, elimination and selection.

Journal of Computer and System Sciences, Vol. 63 (pp 148-184)

Article | https://doi.org/10.1006/jcss.2001.1761 | UvA-DARE

Ambainis, A., de Wolf, R. (2000) Average-Case Quantum Query Complexity.

Lecture Notes in Computer Science, Vol. 1770 (pp 133-144)

Article | UvA-DARE

Ambainis, A., de Wolf, R. (2001) Average-case quantum query complexity.

Journal of Physics. A, Mathematical and General, Vol. 34 (pp 6741-6754)

Article | https://doi.org/10.1088/0305-4470/34/35/302 | UvA-DARE

Ambainis, A., de Wolf, R. (2013) How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?.

In CCC 2013 : 2013 IEEE Conference on Computational Complexity: proceedings : 5-7 June 2013, Palo Alto, California, USA (pp 179-184). IEEE.

Ambainis, A., de Wolf, R. (2014) How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?.

Computational Complexity, Vol. 23 (pp 305-322)

Article | https://doi.org/10.1007/s00037-014-0083-2 | UvA-DARE

Ambainis, A., Mosca, M., Tapp, A., de Wolf, R. (2000) Private quantum channels.

In Proceedings of the 41st IEEE Foundations of Computer Science (FOCS 2000) (pp 547-553)