Author of the publication

Condorcet-Consistent and Approximately Strategyproof Tournament Rules.

, , and . ITCS, volume 67 of LIPIcs, page 35:1-35:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On Infinite Separations Between Simple and Optimal Mechanisms., , and . NeurIPS, (2022)A Simple and Approximately Optimal Mechanism for a Buyer with Complements: Abstract., , , , and . EC, page 323. ACM, (2017)Subsidy Allocations in the Presence of Income Shocks., , and . AAAI, page 7032-7039. AAAI Press, (2020)Auction Learning as a Two-Player Game., , and . ICLR, OpenReview.net, (2021)Decentralized Reinforcement Learning: Global Decision-Making via Local Economic Transactions., , , , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 1437-1447. PMLR, (2020)Exponential communication separations between notions of selfishness., , , , and . STOC, page 947-960. ACM, (2021)The Optimal Mechanism for Selling to a Budget Constrained Buyer: The General Case., and . EC, page 39-40. ACM, (2017)Credible, Truthful, and Two-Round (Optimal) Auctions via Cryptographic Commitments., and . EC, page 683-712. ACM, (2020)Approximately Strategyproof Tournament Rules with Multiple Prizes., , , , and . EC, page 1082-1100. ACM, (2022)Multi-armed Bandit Problems with Strategic Arms., , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 383-416. PMLR, (2019)