default search action
Steven Jecmen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Steven Jecmen, Nihar B. Shah, Fei Fang, Leman Akoglu:
On the Detection of Reviewer-Author Collusion Rings From Paper Bidding. CoRR abs/2402.07860 (2024) - 2023
- [c8]Martin Saveski, Steven Jecmen, Nihar B. Shah, Johan Ugander:
Counterfactual Evaluation of Peer-Review Assignment Policies. NeurIPS 2023 - [c7]Yixuan Xu, Steven Jecmen, Zimeng Song, Fei Fang:
A One-Size-Fits-All Approach to Improving Randomness in Paper Assignment. NeurIPS 2023 - [c6]Steven Jecmen
, Minji Yoon
A Dataset on Malicious Paper Bidding in Peer Review. WWW 2023: 3816-3826 - [i8]Martin Saveski, Steven Jecmen, Nihar B. Shah, Johan Ugander:
Counterfactual Evaluation of Peer-Review Assignment Policies. CoRR abs/2305.17339 (2023) - [i7]Ryan Liu, Steven Jecmen, Vincent Conitzer, Fei Fang, Nihar B. Shah:
Testing for Reviewer Anchoring in Peer Review: A Randomized Controlled Trial. CoRR abs/2307.05443 (2023) - [i6]Yixuan Even Xu, Steven Jecmen, Zimeng Song, Fei Fang
A One-Size-Fits-All Approach to Improving Randomness in Paper Assignment. CoRR abs/2310.05995 (2023) - 2022
- [c5]Steven Jecmen, Hanrui Zhang, Ryan Liu, Fei Fang, Vincent Conitzer, Nihar B. Shah:
Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design. AAMAS 2022: 1642-1644 - [c4]Komal Dhull, Steven Jecmen, Pravesh Kothari, Nihar B. Shah:
Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators' Expertise. HCOMP 2022: 53-63 - [c3]Steven Jecmen, Hanrui Zhang, Ryan Liu, Fei Fang, Vincent Conitzer, Nihar B. Shah:
Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design. HCOMP 2022: 102-113 - [i5]Komal Dhull, Steven Jecmen, Pravesh Kothari, Nihar B. Shah:
The Price of Strategyproofing Peer Assessment. CoRR abs/2201.10631 (2022) - [i4]Steven Jecmen, Minji Yoon, Vincent Conitzer, Nihar B. Shah, Fei Fang
A Dataset on Malicious Paper Bidding in Peer Review. CoRR abs/2207.02303 (2022) - [i3]Steven Jecmen, Nihar B. Shah, Fei Fang
Tradeoffs in Preventing Manipulation in Paper Bidding for Reviewer Assignment. CoRR abs/2207.11315 (2022) - 2021
- [i2]Steven Jecmen, Hanrui Zhang, Ryan Liu, Fei Fang, Vincent Conitzer, Nihar B. Shah:
Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design. CoRR abs/2108.06371 (2021) - 2020
- [c2]Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh:
Bounding Regret in Empirical Games. AAAI 2020: 4280-4287 - [c1]Steven Jecmen, Hanrui Zhang, Ryan Liu, Nihar B. Shah, Vincent Conitzer, Fei Fang:
Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments. NeurIPS 2020 - [i1]Steven Jecmen, Hanrui Zhang, Ryan Liu, Nihar B. Shah, Vincent Conitzer, Fei Fang:
Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments. CoRR abs/2006.16437 (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-02 20:41 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: