9 citations · 14 across the 10 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.GT2025
Strategyproof Tournament Rules for Teams with a Constant Degree of Selfishness
David Pennock, Daniel Schoepflin, Kangning Wang
We revisit the well-studied problem of designing fair and manipulation-resistant tournament rules. In this problem, we seek a mechanism that (probabilistically) identifies the winn…
cs.GT2025
On the Power of Randomization for Obviously Strategy-Proof Mechanisms
Shiri Ron, Daniel Schoepflin
We investigate the problem of designing randomized obviously strategy-proof (OSP) mechanisms in several canonical auction settings. Obvious strategy-proofness, introduced by Li [Am…