Maria Kyropoulou

<TABLE ALIGN="left" BORDER="0" CELLSPACING="0" WIDTH="100%" > <TR> <TD width="17%" bgcolor=black></TD> <TD width="2%" bgcolor=black></TD> <TD width="62%" bgcolor=black><br><h1> Maria Kyropoulou</h1></TD> <TD width="2%" bgcolor=black></TD> <TD width="17%" bgcolor=black></TD></tr> <TR> <TD width="17%" bgcolor="LightGrey"></TD> <TD width="2%"></TD> <TD width="62%"><br><img alt="" src="jinhua.PNG" width="210" HEIGHT="219" align="right"> <br> <table ALIGN="left" BORDER="0" CELLSPACING="0"><tr><td bgcolor="LightGrey"><font size="4"><b> Personal info </b></font></td></tr></table> Currently, I am a postdoc at the <a href="http://www.cs.ox.ac.uk" target="main">Department of Computer Science</a> of the <a href="http://www.ox.ac.uk" target="main">University of Oxford</a> working under <a href="http://www.cs.ox.ac.uk/people/elias.koutsoupias/" target="main">Elias Koutsoupias</a>. My new page will be available soon. You can contact me at: <b>kyropoul@cs.ox.ac.uk</b><br><br> I got my PhD from the Department of Computer Engineering and Informatics at the University of Patras in Greece, where I was advised by <a href="http://www.ceid.upatras.gr/faculty/kakl/" target="main">Christos Kaklamanis</a>.<br><br> My research interests include algorithmic game theory, design and analysis of algorithms, and approximation algorithms. <br><br></TD> <TD width="2%"></TD> <TD width="17%" bgcolor="LightGrey"></TD></TR> <TR> <TD width="17%" bgcolor="LightGrey"></TD> <TD width="2%"></TD> <TD width="62%"><hr size=4></TD> <TD width="2%"></TD> <TD width="17%" bgcolor="LightGrey"></TD></TR> <TR> <TD width="17%" bgcolor="LightGrey"></TD> <TD width="2%"></TD> <TD width="62%"> <br><br> <table ALIGN="left" BORDER="0" CELLSPACING="0"><tr><td bgcolor="LightGrey"><font size="4"><b> Working papers </b></font></td></tr></table> <br><br> I. Caragiannis, C. Kaklamanis, and M. Kyropoulou<br> <strong>Limitations of deterministic auction design for correlated bidders</strong> <a href="OAD.pdf" target="main"><strong>[pdf]</strong></a> <br><br> I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, M. Kyropoulou, B. Lucier, R. Paes Leme, and E. Tardos.<br> <strong>On the efficiency of equilibria in generalized second price auctions</strong> <a href="http://arxiv.org/abs/1201.6429" target="main"><strong>[arXiv]</strong></a> <br><br> <table ALIGN="left" BORDER="0" CELLSPACING="0"><tr><td bgcolor="LightGrey"><font size="4"><b> Journals </b></font></td></tr></table> <br><br> I. Caragiannis, C. Kaklamanis, and M. Kyropoulou<br> <strong>Tight approximation bounds for combinatorial frugal coverage algorithms</strong> <a href="JOCO12.pdf" target="main"><strong>[pdf]</strong></a><br> Journal of Combinatorial Optimization, to appear. <br><br> I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou<br> <strong>The efficiency of fair division</strong> <a href="TOCS11.pdf" target="main"><strong>[pdf]</strong></a><br> Theory of Computing Systems, vol. 50(4), pp. 589-610, 2012. <br><br> <table ALIGN="left" BORDER="0" CELLSPACING="0"><tr><td bgcolor="LightGrey"><font size="4"><b> Conferences </b></font></td></tr></table> <br><br> I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou <br> <strong>Revenue guarantees in sponsored search auctions</strong> <a href="ESA12.pdf" target="main"><strong>[pdf]</strong></a><br> 20th Annual European Symposium on Algorithms, pp. 253-264. (ESA 2012) <br><br> I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou <br> <strong>On the efficiency of equilibria in generalized second price auctions</strong> <a href="EC11.pdf" target="main"><strong>[pdf]</strong></a><br> 12th ACM Conference on Electronic Commerce, pp. 81-90. (EC 2011) <br><br> I. Caragiannis, C. Kaklamanis, and M. Kyropoulou <br> <strong>Tight approximation bounds for greedy frugal coverage algorithms</strong> <a href="FAWAAIM11.pdf" target="main"><strong>[pdf]</strong></a><br> First Joint Conference of the 5th International Frontiers of Algorithmics Workshop and the 7th International <br>Conference on Algorithmic Aspects of Information and Management, pp. 185-195. (FAW-AAIM 2011) <br><br> I. Caragiannis, C. Kaklamanis, P.Kanellopoulos, M. Kyropoulou, and E. Papaioannou <br> <strong>The impact of altruism on the efficiency of atomic congestion games</strong> <a href="TGC10.pdf" target="main"><strong>[pdf]</strong></a><br> 5th Symposium on Trustworthy Global Computing, pp. 172-188. (TGC 2010) <br><br> I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou<br> <strong>The efficiency of fair division</strong> <a href="WINE09.pdf" target="main"><strong>[pdf]</strong></a><br> 5th Workshop on Internet and Network Economics, pp. 475-482. (WINE 2009) <br><br> I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou<br> <strong>On low-envy truthful allocations </strong> <a href="ADT09.pdf" target="main"><strong>[pdf]</strong></a><br> First International Conference on Algorithmic Decision Theory, pp. 111-119. (ADT 2009) <br><br> S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and M. Kyropoulou <br> <strong>An improved approximation bound for spanning star forest and color saving</strong> <a href="MFCS09.pdf" target="main"><strong>[pdf]</strong></a> <br>34th International Symposium on Mathematical Foundations of Computer Science, pp. 90-101. (MFCS 2009) <br><br> <table ALIGN="left" BORDER="0" CELLSPACING="0"><tr><td bgcolor="LightGrey"><font size="4"><b> Other Publications </b></font></td></tr></table> <br><br> N. Karanikolas, M. Kyropoulou, and T. B. Sørensen<br> <strong>Editor's puzzle: Borrowing as cheaply as possible</strong> <a href="ACMSIG-10-2.pdf" target="main"><strong>[pdf]</strong></a><br> SIGecom Exchanges, vol. 10(2), 2011.</TD> <TD width="2%"></TD> <TD width="17%" bgcolor="LightGrey"></TD></TR> <TR> <TD width="17%" bgcolor="LightGrey"></TD> <TD width="2%"></TD> <TD width="62%"><hr size=4></TD> <TD width="2%"></TD> <TD width="17%" bgcolor="LightGrey"></TD></TR> </TABLE>