Airiau, S., Aziz, H.
, Caragiannis, I., Kruger, J., Lang, J. & Peters, D. (2023).
Portioning using ordinal preferences: Fairness and efficiency.
Artificial Intelligence,
314, Article 103809.
https://doi.org/10.1016/j.artint.2022.103809
Chaugule, P., Kumar, M., Limaye, N., Mohapatra, C. K., She, A.
& Srinivasan, S. (2023).
Schur Polynomials Do Not Have Small Formulas If the Determinant does not.
Computational Complexity,
32(1), Article 3.
https://doi.org/10.1007/s00037-023-00236-x
Bouras, C.
, Caragiannis, I., Gkamas, A., Protopapas, N., Sardelis, T. & Sgarbas, K. (2023).
State of the Art Analysis of Resource Allocation Techniques in 5G MIMO Networks. In
37th International Conference on Information Networking, ICOIN 2023 (pp. 632-637). IEEE.
https://doi.org/10.1109/ICOIN56518.2023.10049018
Fournier, H., Limaye, N., Malod, G.
, Srinivasan, S. & Tavenas, S. (2023).
Towards Optimal Depth-Reductions for Algebraic Formulas. In A. Ta-Shma (Ed.),
38th Computational Complexity Conference, CCC 2023 Article 28 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.CCC.2023.28
Bilo, V.
, Caragiannis, I., Flammini, M., Igarashi, A., Monaco, G., Peters, D., Vinci, C. & Zwicker, W. (2022).
Almost envy-free allocations with connected bundles.
Games and Economic Behavior,
131, 197-221.
https://doi.org/10.1016/j.geb.2021.11.006
Caragiannis, I., Gravin, N., Lu, P. & Wang, Z. (2022).
Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. In M. Feldman, H. Fu & I. Talgam-Cohen (Eds.),
Web and Internet Economics : 17th International Conference, WINE 2021 (pp. 131-148). Springer.
https://doi.org/10.1007/978-3-030-94676-0_8
Hansen, K. A., Liu, T. X. & Malekian, A. (Eds.) (2022).
Web and Internet Economics: 18th International Conference, WINE 2022, Troy, NY, USA, December 12-15, 2022, Proceedings. Springer. Lecture Notes in Computer Science Vol. 13778
https://doi.org/10.1007/978-3-031-22832-2
Blanc, M.
& Hansen, K. A. (2021).
Computational Complexity of Multi-player Evolutionarily Stable Strategies. In R. Santhanam & D. Musatov (Eds.),
Computer Science – Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Proceedings: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings (pp. 1-17). Springer.
https://doi.org/10.1007/978-3-030-79416-31
Dan, C.
, Hansen, K. A., Jiang, H., Wang, L. & Zhou, Y. (2018).
Low rank approximation of binary matrices: Column subset selection and generalizations. In I. Potapov, J. Worrell & P. Spirakis (Eds.),
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 (Vol. 117, pp. 41:1-41:16). Article 41 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.MFCS.2018.41
Bosanský, B., Brânzei, S.
, Hansen, K. A., Lund, T. B.
& Miltersen, P. B. (2017).
Computation of Stackelberg Equilibria of Finite Sequential Games.
A C M Transactions on Economics and Computation,
5(4), 23:1-23:24. Article 23.
https://doi.org/10.1145/3133242