default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarios Mertzanidis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c7]Thanasis Lianeas, Marios Mertzanidis, Aikaterini Nikolidaki
:
Facility Location for Congesting Commuters and Generalizing the Cost-Distance Problem. AAAI 2026: 17093-17101- [c6]Ethan Dickey, Marios Mertzanidis, Alexandros Psomas:
Is Solving Better Than Evaluating GenAI Solutions? SIGCSE (2) 2026: 1289-1290 - [c5]Marios Mertzanidis, Athina Terzoglou:
Hallucinating Flows for Optimal Mechanisms. SODA 2026: 2195-2238 - [i9]Ethan Dickey, Marios Mertzanidis, Christos-Alexandros Psomas:
Is Solving Better Than Evaluating GenAI Solutions? CoRR abs/2607.27586 (2026) - 2025
- [c4]Kshipra Bhawalkar, Marios Mertzanidis, Divyarthi Mohan, Alexandros Psomas:
Mechanism Design via the Interim Relaxation. NeurIPS 2025 - [i8]Marios Mertzanidis, Athina Terzoglou:
Hallucinating Flows for Optimal Mechanisms. CoRR abs/2510.05474 (2025) - [i7]Egor Gagushin, Marios Mertzanidis, Alexandros Psomas:
On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences. CoRR abs/2511.03810 (2025) - [i6]Thanasis Lianeas, Marios Mertzanidis, Aikaterini Nikolidaki:
Facility Location for Congesting Commuters and Generalizing the Cost-Distance Problem. CoRR abs/2511.10228 (2025) - 2024
- [c3]Marios Mertzanidis, Alexandros Psomas, Paritosh Verma:
Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation. EC 2024: 243 - [i5]Marios Mertzanidis, Christos-Alexandros Psomas, Paritosh Verma:
Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation. CoRR abs/2406.06363 (2024) - [i4]Kshipra Bhawalkar, Marios Mertzanidis, Divyarthi Mohan, Alexandros Psomas:
Mechanism Design via the Interim Relaxation. CoRR abs/2407.12699 (2024) - [i3]Gagan Aggarwal, Marios Mertzanidis, Alexandros Psomas, Di Wang:
Mechanism Design with Delegated Bidding. CoRR abs/2409.19087 (2024) - 2023
- [c2]Christos Boutsikas, Petros Drineas, Marios Mertzanidis, Alexandros Psomas, Paritosh Verma:
Refined Mechanism Design for Approximately Structured Priors via Active Regression. NeurIPS 2023 - [c1]Anuran Makur, Marios Mertzanidis, Alexandros Psomas, Athina Terzoglou:
On the Robustness of Mechanism Design under Total Variation Distance. NeurIPS 2023 - [i2]Anuran Makur, Marios Mertzanidis, Alexandros Psomas, Athina Terzoglou:
On the Robustness of Mechanism Design under Total Variation Distance. CoRR abs/2310.07809 (2023) - [i1]Christos Boutsikas, Petros Drineas, Marios Mertzanidis, Alexandros Psomas, Paritosh Verma:
Refined Mechanism Design for Approximately Structured Priors via Active Regression. CoRR abs/2310.07874 (2023)
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 2026-08-12 23:22 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
