default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPanagiota N. Panagopoulou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c15]Panagiota N. Panagopoulou:
Simple algorithmic techniques to approximate nash equilibria. PCI 2018: 4-9- 2015
- [j6]Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the structure of equilibria in basic network formation. Theor. Comput. Sci. 590: 96-105 (2015) - [c14]Shlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis:
Rationality Authority for Provable Rational Behavior. Algorithms, Probability, Networks, and Games 2015: 33-48 - [c13]Panagiota N. Panagopoulou:
Efficient Equilibrium Concepts in Non-cooperative Network Formation. Algorithms, Probability, Networks, and Games 2015: 384-395 - 2014
- [j5]Panagiota N. Panagopoulou, Paul G. Spirakis:
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). Theory Comput. Syst. 54(3): 479-490 (2014) - 2013
- [c12]Paul G. Spirakis, Panagiota N. Panagopoulou:
Potential Functions in Strategic Games. CSR 2013: 283-297 - [c11]Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the Structure of Equilibria in Basic Network Formation. FCT 2013: 259-270 - [i4]Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the Structure of Equilibria in Basic Network Formation. CoRR abs/1306.1677 (2013) - 2012
- [j4]Panagiota N. Panagopoulou, Paul G. Spirakis:
Playing a Game to Bound the Chromatic Number. Am. Math. Mon. 119(9): 771-778 (2012) - 2011
- [c10]Shlomi Dolev
, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis:
Rationality authority for provable rational behavior. PODC 2011: 289-290 - [c9]Panagiota N. Panagopoulou, Paul G. Spirakis:
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). SAGT 2011: 190-199 - 2010
- [c8]Paul G. Spirakis, Ioannis Chatzigiannakis, Georgios Mylonas, Panagiota N. Panagopoulou:
Fun with Games. FUN 2010: 4-15 - [c7]Ioannis Chatzigiannakis, Christos Koninis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Distributed Game-Theoretic Vertex Coloring. OPODIS 2010: 103-118
2000 – 2009
- 2009
- [j3]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Polynomial algorithms for approximating Nash equilibria of bimatrix games. Theor. Comput. Sci. 410(17): 1599-1606 (2009) - 2008
- [b1]Panagiota N. Panagopoulou:
Αλγοριθμική και εξελικτική θεωρία παιγνίων. University of Patras, Greece, 2008 - [j2]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
Cost Sharing Mechanisms for Fair Pricing of Resource Usage. Algorithmica 52(1): 19-43 (2008) - [c6]Panagiota N. Panagopoulou, Paul G. Spirakis:
A Game Theoretic Approach for Efficient Graph Coloring. ISAAC 2008: 183-195 - [r1]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Approximations of Bimatrix Nash Equilibria. Encyclopedia of Algorithms 2008 - 2007
- [c5]Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis:
Selfish Load Balancing Under Partial Knowledge. MFCS 2007: 609-620 - [c4]Panagiota N. Panagopoulou, Paul G. Spirakis:
Full and Local Information in Distributed Decision Making. WAOA 2007: 156-169 - 2006
- [j1]Panagiota N. Panagopoulou, Paul G. Spirakis:
Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11 (2006) - [c3]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. WINE 2006: 286-296 - [i3]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c2]Panagiota N. Panagopoulou, Paul G. Spirakis:
Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games. WEA 2005: 203-215 - [c1]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
A Cost Mechanism for Fair Pricing of Resource Usage. WINE 2005: 210-224 - [i2]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
A Cost Mechanism for Fair Pricing of Resource Usage. Algorithmic Aspects of Large and Complex Networks 2005 - [i1]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
Cost Sharing Mechanisms for Fair Pricing of Resources Usage. Algorithmic Aspects of Large and Complex Networks 2005
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
