default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXizhi Tan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan, Paritosh Verma:
Getting More by Knowing Less: Bayesian Incentive Compatible Mechanisms for Fair Division. IJCAI 2024: 2807-2815- [c7]Sara Ahmadian
, Sreenivas Gollapudi, Gregory Hutchins, Kostas Kollias, Xizhi Tan:
Extracting Small Subgraphs in Road Networks. WWW 2024: 493-502 - [i10]Vasilis Gkatzelis, Daniel Schoepflin, Xizhi Tan:
Clock Auctions Augmented with Unreliable Advice. CoRR abs/2408.06483 (2024) - 2023
- [c6]Marius Garbea, Vasilis Gkatzelis, Xizhi Tan:
EFx Budget-Feasible Allocations with High Nash Welfare. ECAI 2023: 795-802 - [c5]Eric Balkanski, Vasilis Gkatzelis, Xizhi Tan:
Strategyproof Scheduling with Predictions. ITCS 2023: 11:1-11:22 - [i9]Marius Garbea, Vasilis Gkatzelis, Xizhi Tan:
EFx Budget-Feasible Allocations with High Nash Welfare. CoRR abs/2305.02280 (2023) - [i8]Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan, Paritosh Verma:
Getting More by Knowing Less: Bayesian Incentive Compatible Mechanisms for Fair Division. CoRR abs/2306.02040 (2023) - [i7]Ben Berger, Michal Feldman, Vasilis Gkatzelis, Xizhi Tan:
Optimal Metric Distortion with Predictions. CoRR abs/2307.07495 (2023) - [i6]Eric Balkanski, Vasilis Gkatzelis, Xizhi Tan, Cherlin Zhu:
Online Mechanism Design with Predictions. CoRR abs/2310.02879 (2023) - 2022
- [c4]Priyank Agrawal, Eric Balkanski, Vasilis Gkatzelis, Tingting Ou, Xizhi Tan:
Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location. EC 2022: 497-528 - [c3]Vasilis Gkatzelis, Kostas Kollias, Alkmini Sgouritsa, Xizhi Tan:
Improved Price of Anarchy via Predictions. EC 2022: 529-557 - [c2]Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, Xizhi Tan:
Deterministic Budget-Feasible Clock Auctions. SODA 2022: 2940-2963 - [i5]Priyank Agrawal, Eric Balkanski, Vasilis Gkatzelis, Tingting Ou, Xizhi Tan:
Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location. CoRR abs/2204.01120 (2022) - [i4]Vasilis Gkatzelis, Kostas Kollias, Alkmini Sgouritsa, Xizhi Tan:
Improved Price of Anarchy via Predictions. CoRR abs/2205.04252 (2022) - [i3]Eric Balkanski, Vasilis Gkatzelis, Xizhi Tan:
Strategyproof Scheduling with Predictions. CoRR abs/2209.04058 (2022) - 2021
- [c1]Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan:
Fair and Efficient Online Allocations with Normalized Valuations. AAAI 2021: 5440-5447 - [i2]Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, Xizhi Tan:
Deterministic Budget-Feasible Clock Auctions. CoRR abs/2107.09239 (2021) - 2020
- [i1]Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan:
Fair and Efficient Online Allocations with Normalized Valuations. CoRR abs/2009.12405 (2020)
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-10-21 21:31 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:
