default search action
Maria Kyropoulou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Panagiotis Kanellopoulos, Maria Kyropoulou, Hao Zhou:
On priority-proportional payments in financial networks. Theor. Comput. Sci. 1014: 114767 (2024) - 2023
- [j13]Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris:
Not all strangers are the same: The impact of tolerance in Schelling games. Theor. Comput. Sci. 971: 114065 (2023) - [c24]Panagiotis Kanellopoulos, Maria Kyropoulou, Hao Zhou:
Debt Transfers in Financial Networks: Complexity and Equilibria. AAMAS 2023: 260-268 - [c23]Evangelia Christodoulaki
, Michael Kampouridis
Enhanced Strongly typed Genetic Programming for Algorithmic Trading. GECCO 2023: 1055-1063 - 2022
- [j12]Michael Kampouridis, Panagiotis Kanellopoulos, Maria Kyropoulou, Themistoklis Melissourgos, Alexandros A. Voudouris
Multi-agent systems for computational economics and finance. AI Commun. 35(4): 369-380 (2022) - [j11]Maria Kyropoulou, Josué Ortega
Fair cake-cutting in practice. Games Econ. Behav. 133: 28-49 (2022) - [c22]Panagiotis Kanellopoulos, Maria Kyropoulou, Hao Zhou:
Forgiving Debt in Financial Network Games. AAMAS 2022: 1651-1653 - [c21]Panagiotis Kanellopoulos, Maria Kyropoulou, Hao Zhou:
Forgiving Debt in Financial Network Games. IJCAI 2022: 335-341 - [c20]Panagiotis Kanellopoulos
Not All Strangers Are the Same: The Impact of Tolerance in Schelling Games. MFCS 2022: 60:1-60:14 - [e1]Panagiotis Kanellopoulos
Algorithmic Game Theory - 15th International Symposium, SAGT 2022, Colchester, UK, September 12-15, 2022, Proceedings. Lecture Notes in Computer Science 13584, Springer 2022, ISBN 978-3-031-15713-4 [contents] - [i12]Panagiotis Kanellopoulos, Maria Kyropoulou, Hao Zhou:
Forgiving Debt in Financial Network Games. CoRR abs/2202.10986 (2022) - [i11]Michael Kampouridis, Panagiotis Kanellopoulos, Maria Kyropoulou, Themistoklis Melissourgos, Alexandros A. Voudouris
Multi-Agent Systems for Computational Economics and Finance. CoRR abs/2210.03540 (2022) - 2021
- [j10]Panagiotis Kanellopoulos
Modified Schelling games. Theor. Comput. Sci. 880: 1-19 (2021) - [c19]Panagiotis Kanellopoulos, Maria Kyropoulou, Hao Zhou:
Financial network games. ICAIF 2021: 26:1-26:9 - [c18]Ioannis Caragiannis, Panagiotis Kanellopoulos, Maria Kyropoulou:
On Interim Envy-Free Allocation Lotteries. EC 2021: 264-284 - [i10]Ioannis Caragiannis, Panagiotis Kanellopoulos, Maria Kyropoulou:
On Interim Envy-Free Allocation Lotteries. CoRR abs/2102.07839 (2021) - [i9]Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris:
Not all Strangers are the Same: The Impact of Tolerance in Schelling Games. CoRR abs/2105.02699 (2021) - [i8]Panagiotis Kanellopoulos, Maria Kyropoulou, Hao Zhou:
Financial Network Games. CoRR abs/2107.06623 (2021) - 2020
- [j9]Maria Kyropoulou, Warut Suksompong, Alexandros A. Voudouris
Almost envy-freeness in group resource allocation. Theor. Comput. Sci. 841: 110-123 (2020) - [c17]Bart de Keijzer, Maria Kyropoulou, Carmine Ventre
Obviously Strategyproof Single-Minded Combinatorial Auctions. ICALP 2020: 71:1-71:17 - [c16]Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris
Modified Schelling Games. SAGT 2020: 241-256 - [i7]Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris:
Modified Schelling Games. CoRR abs/2005.12149 (2020)
2010 – 2019
- 2019
- [j8]Yiannis Giannakopoulos
The anarchy of scheduling without money. Theor. Comput. Sci. 778: 19-32 (2019) - [c15]Maria Kyropoulou, Carmine Ventre:
Obviously Strategyproof Mechanisms without Money for Scheduling. AAMAS 2019: 1574-1581 - [c14]Maria Kyropoulou, Josué Ortega
Fair Cake-Cutting in Practice. EC 2019: 547-548 - [c13]Maria Kyropoulou, Warut Suksompong, Alexandros A. Voudouris:
Almost Envy-Freeness in Group Resource Allocation. IJCAI 2019: 400-406 - [c12]Maria Kyropoulou, Carmine Ventre
Mechanism Design for Constrained Heterogeneous Facility Location. SAGT 2019: 63-76 - [i6]Maria Kyropoulou, Warut Suksompong, Alexandros A. Voudouris:
Almost Envy-Freeness in Group Resource Allocation. CoRR abs/1901.08463 (2019) - 2018
- [i5]Maria Kyropoulou, Josue Ortega, Erel Segal-Halevi:
Fair Cake-Cutting in Practice. CoRR abs/1810.08243 (2018) - 2017
- [j7]Yiannis Giannakopoulos
The VCG Mechanism for Bayesian Scheduling. ACM Trans. Economics and Comput. 5(4): 19:1-19:16 (2017) - 2016
- [j6]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
Limitations of Deterministic Auction Design for Correlated Bidders. ACM Trans. Comput. Theory 8(4): 13:1-13:18 (2016) - [c11]Yiannis Giannakopoulos
The Anarchy of Scheduling Without Money. SAGT 2016: 302-314 - [c10]Aggelos Kiayias, Elias Koutsoupias, Maria Kyropoulou, Yiannis Tselekounis:
Blockchain Mining Games. EC 2016: 365-382 - [i4]Aggelos Kiayias, Elias Koutsoupias, Maria Kyropoulou, Yiannis Tselekounis:
Blockchain Mining Games. CoRR abs/1607.02420 (2016) - [i3]Yiannis Giannakopoulos
The Anarchy of Scheduling Without Money. CoRR abs/1607.03688 (2016) - 2015
- [j5]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
Bounding the inefficiency of outcomes in generalized second price auctions. J. Econ. Theory 156: 343-388 (2015) - [c9]Yiannis Giannakopoulos
The VCG Mechanism for Bayesian Scheduling. WINE 2015: 343-356 - [i2]Yiannis Giannakopoulos, Maria Kyropoulou:
The VCG Mechanism for Bayesian Scheduling. CoRR abs/1509.07455 (2015) - 2014
- [b1]Maria Kyropoulou:
Υπολογιστικά ζητήματα σε στρατηγικά παίγνια και διαδικασίες κοινωνικής επιλογής. University of Patras, Greece, 2014 - [j4]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
Revenue Guarantees in the Generalized Second Price Auction. ACM Trans. Internet Techn. 14(2-3): 17:1-17:19 (2014) - 2013
- [j3]Ioannis Caragiannis
Tight approximation bounds for combinatorial frugal coverage algorithms. J. Comb. Optim. 26(2): 292-309 (2013) - [c8]Ioannis Caragiannis
Limitations of Deterministic Auction Design for Correlated Bidders. ESA 2013: 277-288 - 2012
- [j2]Ioannis Caragiannis
The Efficiency of Fair Division. Theory Comput. Syst. 50(4): 589-610 (2012) - [c7]Ioannis Caragiannis
Revenue Guarantees in Sponsored Search Auctions. ESA 2012: 253-264 - [i1]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos:
On the efficiency of equilibria in generalized second price auctions. CoRR abs/1201.6429 (2012) - 2011
- [j1]Nikos Karanikolas, Maria Kyropoulou, Troels Bjerre Sørensen:
Solution to Exchanges 9.1 puzzle: borrowing as cheaply as possible. SIGecom Exch. 10(2): 51-52 (2011) - [c6]Ioannis Caragiannis
Tight Approximation Bounds for Greedy Frugal Coverage Algorithms. FAW-AAIM 2011: 185-195 - [c5]Ioannis Caragiannis
On the efficiency of equilibria in generalized second price auctions. EC 2011: 81-90 - 2010
- [c4]Ioannis Caragiannis
The Impact of Altruism on the Efficiency of Atomic Congestion Games. TGC 2010: 172-188
2000 – 2009
- 2009
- [c3]Ioannis Caragiannis
On Low-Envy Truthful Allocations. ADT 2009: 111-119 - [c2]Stavros Athanassopoulos, Ioannis Caragiannis
An Improved Approximation Bound for Spanning Star Forest and Color Saving. MFCS 2009: 90-101 - [c1]Ioannis Caragiannis
The Efficiency of Fair Division. WINE 2009: 475-482
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-08-16 19:27 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: