default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYotam Gafni
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Yotam Gafni
, Aviv Yaish:
Discrete and Bayesian Transaction Fee Mechanisms. MARBLE 2024: 145-171- [c7]Yotam Gafni, Ronen Gradwohl, Moshe Tennenholtz:
Prediction-Sharing During Training and Inference. SAGT 2024: 425-442 - [c6]Yotam Gafni, Aviv Yaish:
Barriers to Collusion-resistant Transaction Fee Mechanisms. EC 2024: 1074-1096 - [i11]Yotam Gafni, Aviv Yaish:
Competitive Revenue Extraction from Time-Discounted Transactions in the Semi-Myopic Regime. CoRR abs/2402.08549 (2024) - [i10]Yotam Gafni, Aviv Yaish:
Barriers to Collusion-resistant Transaction Fee Mechanisms. CoRR abs/2402.08564 (2024) - [i9]Yotam Gafni, Ronen Gradwohl, Moshe Tennenholtz:
Prediction-sharing During Training and Inference. CoRR abs/2403.17515 (2024) - [i8]Yotam Gafni, Ben Golan:
Beyond Proportional Individual Guarantees for Binary Perpetual Voting. CoRR abs/2408.08767 (2024) - [i7]Matheus V. X. Ferreira, Yotam Gafni, Max Resnick:
Incentive-Compatible Collusion-Resistance via Posted Prices. CoRR abs/2412.20853 (2024) - 2023
- [c5]Xiaotie Deng, Yotam Gafni, Ron Lavi, Tao Lin, Hongyi Ling:
From Monopoly to Competition: Optimal Contests Prevail. AAAI 2023: 5608-5615 - [c4]Yotam Gafni, Moshe Tennenholtz:
Optimal Mechanism Design for Agents with DSL Strategies: The Case of Sybil Attacks in Combinatorial Auctions. TARK 2023: 245-259 - 2022
- [c3]Yotam Gafni, Moshe Tennenholtz:
Long-term Data Sharing under Exclusivity Attacks. EC 2022: 739-759 - [i6]Yotam Gafni, Moshe Tennenholtz:
Long-term Data Sharing under Exclusivity Attacks. CoRR abs/2201.09137 (2022) - [i5]Yotam Gafni, Aviv Yaish:
Greedy Transaction Fee Mechanisms for (Non-)myopic Miners. CoRR abs/2210.07793 (2022) - 2021
- [j1]Yotam Gafni, Ron Lavi, Moshe Tennenholtz:
Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation. J. Artif. Intell. Res. 72: 99-135 (2021) - [c2]Yotam Gafni, Ron Lavi, Moshe Tennenholtz:
Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with Application to False-name Manipulation. IJCAI 2021: 210-216 - [i4]Xiaotie Deng, Yotam Gafni, Ron Lavi, Tao Lin, Hongyi Ling:
From Monopoly to Competition: Optimal Contests Prevail. CoRR abs/2107.13363 (2021) - [i3]Yotam Gafni, Ron Lavi, Moshe Tennenholtz:
Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with Application to False-name Manipulation. CoRR abs/2108.09216 (2021) - [i2]Yotam Gafni, Xin Huang, Ron Lavi, Inbal Talgam-Cohen:
Unified Fair Allocation of Goods and Chores via Copies. CoRR abs/2109.08671 (2021) - 2020
- [c1]Yotam Gafni, Ron Lavi, Moshe Tennenholtz:
VCG under Sybil (False-Name) Attacks - A Bayesian Analysis. AAAI 2020: 1966-1973
2010 – 2019
- 2019
- [i1]Yotam Gafni, Ron Lavi, Moshe Tennenholtz:
VCG Under Sybil (False-name) Attacks - a Bayesian Analysis. CoRR abs/1911.07210 (2019)
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 2025-03-04 02:03 CET 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:
