pith. sign in

arxiv: 2012.02893 · v1 · pith:TVICX57Wnew · submitted 2020-12-04 · 💻 cs.GT

Non-quasi-linear Agents in Quasi-linear Mechanisms

classification 💻 cs.GT
keywords agentsquasi-lineardisutilitymechanismsroi-optimalbuyersdesignedmoney
0
0 comments X
read the original abstract

Mechanisms with money are commonly designed under the assumption that agents are quasi-linear, meaning they have linear disutility for spending money. We study the implications when agents with non-linear (specifically, convex) disutility for payments participate in mechanisms designed for quasi-linear agents. We first show that any mechanism that is truthful for quasi-linear buyers has a simple best response function for buyers with non-linear disutility from payments, in which each bidder simply scales down her value for each potential outcome by a fixed factor, equal to her target return on investment (ROI). We call such a strategy ROI-optimal. We prove the existence of a Nash equilibrium in which agents use ROI-optimal strategies for a general class of allocation problems. Motivated by online marketplaces, we then focus on simultaneous second-price auctions for additive bidders and show that all ROI-optimal equilibria in this setting achieve constant-factor approximations to suitable welfare and revenue benchmarks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Gradient Dynamics in First-Price Auctions: Iterative Strategy Elimination via Cubic Potentials

    cs.GT 2026-06 unverdicted novelty 7.0

    In discretized first-price auctions, online gradient ascent by buyers produces time-average outcomes that match the efficient allocation of the second-price auction.