IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2607.16343.html

When Pricing Agents Meet Buying Agents: Personalized Pricing and Verifiable Trust

Author

Listed:
  • Chupeng Xie

Abstract

Same fairness rule, different posterior, no trade. We study personalized pricing when seller and buyer principals delegate to agents that receive different value signals and execute machine-enforced mandates. Equal nominal surplus rules can be incompatible because each is applied to its agent's posterior. In one common environment, we solve nested pricing, inspection, mandate-selection, and repeated-relationship subgames. Signal attestation and execution attestation have different effects: evidence of a high seller signal can legitimate a high price, whereas evidence of a restrained rule can prevent unauthorized extraction. Verification can recover trade and soften both principals' policies only when it covers the disputed proposition. In repeated transactions, attributable offers above a buyer's reference cap depreciate relationship capital, producing a state-dependent Markov policy and a reference-respecting region. Verification is privately underprovided when the seller does not internalize avoided buyer inspection and relationship spillovers, but can be overprovided when it facilitates extraction. The model links AI measurement, algorithmic extraction, and verifiable restraint without treating trust as software emotion or verified execution as proof of true value.

Suggested Citation

  • Chupeng Xie, 2026. "When Pricing Agents Meet Buying Agents: Personalized Pricing and Verifiable Trust," Papers 2607.16343, arXiv.org.
  • Handle: RePEc:arx:papers:2607.16343
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2607.16343
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2607.16343. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.