Pith. sign in

REVIEW 1 cited by

Non-quasi-linear Agents in Quasi-linear Mechanisms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.02893 v1 pith:TVICX57W submitted 2020-12-04 cs.GT

classification cs.GT
keywords agentsquasi-lineardisutilitymechanismsroi-optimalbuyersdesignedmoney
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint

    cs.GT 2025-02 conditional novelty 7.0 of 10

    Strictly satisfying the return-on-spend constraint in online auto-bidding forces linear regret; a near-optimal algorithm exists only for constant values and threshold auctions.

Pith tools