2 citations · 3 across the 3 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2021★ 2 cited
Agreement Implies Accuracy for Substitutable Signals
Rafael Frongillo, Eric Neyman, Bo Waggoner
Inspired by Aumann's agreement theorem, Scott Aaronson studied the amount of communication necessary for two Bayesian experts to approximately agree on the expectation of a random…
cs.GT2021
Strictly Proper Contract Functions Can Be Arbitrage-Free
Eric Neyman, Tim Roughgarden
We consider mechanisms for truthfully eliciting probabilistic predictions from a group of experts. The standard approach -- using a proper scoring rule to separately reward each ex…
cs.GT2018
Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions
Tomer Ezra, Michal Feldman, Eric Neyman +2
We study the communication complexity of welfare maximization in combinatorial auctions with items and two subadditive bidders. A -approximation can be guaranteed…