Panagiota N. Panagopoulou

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Random bimatrix games are asymptotically easy to solve (a simple proof) Theory of Computing Systems	2017-11-07	Paper
Efficient equilibrium concepts in non-cooperative network formation Algorithms, Probability, Networks, and Games	2016-01-27	Paper
Rationality authority for provable rational behavior Algorithms, Probability, Networks, and Games	2016-01-27	Paper
On the structure of equilibria in basic network formation Theoretical Computer Science	2015-06-10	Paper
On the Structure of Equilibria in Basic Network Formation Fundamentals of Computation Theory	2013-08-16	Paper
Potential Functions in Strategic Games Computer Science – Theory and Applications	2013-06-14	Paper
Playing a game to bound the chromatic number The American Mathematical Monthly	2013-05-28	Paper
Random bimatrix games are asymptotically easy to solve (a simple proof) Algorithmic Game Theory	2011-10-28	Paper
Polynomial algorithms for approximating Nash equilibria of bimatrix games Theoretical Computer Science	2009-04-29	Paper
A Game Theoretic Approach for Efficient Graph Coloring Algorithms and Computation	2009-01-29	Paper
Selfish Load Balancing Under Partial Knowledge Mathematical Foundations of Computer Science 2007	2008-09-17	Paper
Cost sharing mechanisms for fair pricing of resource usage Algorithmica	2008-09-12	Paper
Algorithms for pure Nash equilibria in weighted congestion games ACM Journal of Experimental Algorithmics	2008-06-20	Paper
Full and Local Information in Distributed Decision Making Approximation and Online Algorithms	2008-02-20	Paper
Experimental and Efficient Algorithms Lecture Notes in Computer Science	2005-11-30	Paper

Research outcomes over time

This page was built for person: Panagiota N. Panagopoulou