no code implementations • 29 Mar 2024 • Ian Ball, Teemu Pekkarinen
We study the design of an auction for a license.
no code implementations • 11 Dec 2023 • Ian Ball
This note gives simpler proofs of the variational and multiple priors representations in Maccheroni et al. (2006) and Gilboa and Schmeidler (1989).
no code implementations • 20 Nov 2023 • Ian Ball, Xin Gao
A principal delegates decisions to a biased agent.
no code implementations • 14 Sep 2023 • Ian Ball, Deniz Kattwinkel
We establish a tight bound on the ex-post decision error under quota mechanisms, for a finite number of linked problems.
no code implementations • 8 May 2023 • Ian Ball
This note shows that in Bauer's maximum principle, the assumed convexity of the objective function can be relaxed to quasiconvexity.
no code implementations • 12 Apr 2023 • Ian Ball, Deniz Kattwinkel
We correct a gap in the proof of Theorem 2 in Matsushima et al. (2010).
no code implementations • 3 Apr 2023 • Ian Ball, Jan Knoepfle
A principal hires an agent to work on a long-term project that culminates in a breakthrough or a breakdown.
no code implementations • 16 Mar 2023 • Ian Ball
I solve for the sender's optimal policy in closed form: the sender reports the value of the state with a delay that shrinks over time and eventually vanishes.
no code implementations • 13 Mar 2023 • Ian Ball
This note presents a unified theorem of the alternative that explicitly allows for any combination of equality, componentwise inequality, weak dominance, strict dominance, and nonnegativity relations.
no code implementations • 27 May 2022 • Ian Ball, James Bono, Justin Grana, Nicole Immorlica, Brendan Lucier, Aleksandrs Slivkins
We develop a model of content filtering as a game between the filter and the content consumer, where the latter incurs information costs for examining the content.
no code implementations • 6 May 2022 • Ian Ball, Matt O. Jackson, Deniz Kattwinkel
The proof of their main theorem uses a different permutation-based definition, implicitly claiming that the permutation-version implies the bound-based version.
no code implementations • 4 Sep 2019 • Ian Ball
This rule underweights some features to deter sender distortion, and overweights other features so that the score is correct on average.
no code implementations • 15 Aug 2019 • Ian Ball, Deniz Kattwinkel
The agent's true type determines the probability with which he can pass each test.