I am a Ph.D. student in the Department of Computer Science at Yale University, where I am very fortunate to be advised by Prof. Yang Cai. Before coming to Yale, I graduated from the National Technical University of Athens with a Diploma in Electrical and Computer Engineering, where I completed my Diploma Thesis (available in Greek here) in Graph Drawing under the supervision of Prof. Antonios Symvonis.
My research interests lie in in the intersection of Computer Science & Economics, and more specifically in problems in Mechanism Design and Algorithmic Game Theory.
If you want to contact me, you can send me an e-mail at: argyris.oikonomou@yale.edu
Computing Simple Mechanisms: Lift-and-Round over Marginal Reduced Forms.
Y. Cai, A. Oikonomou, M. Zhao.
Proceedings of the 54th Annual ACM Symposium on Theory of Computing (STOC 2022).
An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization.
Y. Cai, A. Oikonomou, G. Velegkas, M. Zhao.
In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 21).
On Simple Mechanisms for Weakly Dependent Items.
Y. Cai, A. Oikonomou.
In Proceedings of the 22nd ACM Conference on Economics and Computation,
(EC 2021).
An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization.
Y. Cai, A. Oikonomou, G. Velegkas, M. Zhao.
In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 21).
Monotone Drawings of k-Inner Planar Graphs.
A. Oikonomou, A. Symvonis.
In Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018).
Simple Compact Monotone Tree Drawings.
A. Oikonomou, A. Symvonis.
In Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017).