Panagiota N. Panagopoulou

According to our database1, Panagiota N. Panagopoulou authored at least 19 papers between 2005 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Simple algorithmic techniques to approximate nash equilibria.
Proceedings of the 22nd Pan-Hellenic Conference on Informatics, 2018

2015
On the structure of equilibria in basic network formation.
Theor. Comput. Sci., 2015

Efficient Equilibrium Concepts in Non-cooperative Network Formation.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

Rationality Authority for Provable Rational Behavior.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

2014
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof).
Theory Comput. Syst., 2014

2013
Potential Functions in Strategic Games.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
Playing a Game to Bound the Chromatic Number.
The American Mathematical Monthly, 2012

2010
Distributed Game-Theoretic Vertex Coloring.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Fun with Games.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009
Polynomial algorithms for approximating Nash equilibria of bimatrix games.
Theor. Comput. Sci., 2009

2008
Approximations of Bimatrix Nash Equilibria.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Cost Sharing Mechanisms for Fair Pricing of Resource Usage.
Algorithmica, 2008

A Game Theoretic Approach for Efficient Graph Coloring.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Full and Local Information in Distributed Decision Making.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Selfish Load Balancing Under Partial Knowledge.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Algorithms for pure Nash equilibria in weighted congestion games.
ACM Journal of Experimental Algorithmics, 2006

2005
Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Cost Sharing Mechanisms for Fair Pricing of Resources Usage.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

A Cost Mechanism for Fair Pricing of Resource Usage.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005


  Loading...