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

Exact Budget Balance via Payment-Rule Ambiguity: Incentive Preservation, Transfer Capacity, and Participation

Author

Listed:
  • Hiroaki Odahara

    (Market Design Center, Graduate School of Economics, The University of Tokyo
    Graduate School of Informatics and Engineering, The University of Electro-Communications)

Abstract

This paper asks whether the payment side of an incentive-compatible mechanism can be repaired so that every realized settlement balances exactly while the allocation and all report-by-report comparisons under the maintained worst-case evaluation remain unchanged. Before reports, the designer commits to a menu of payment rules and a report-blind selection protocol. A pointwise preservation condition then carries over dominant-strategy incentives. Under a full-support common reference, a precisely known label law permits repair only if the original rule already balances, whereas frequency uncertainty about even one non-worst label makes every non-deficit rule repairable. Under the common residual-ambiguity benchmark, every preserving, exactly balanced finite menu at a positive-surplus state requires more transfer capacity as certified frequency information becomes tighter. In the canonical menu, fixing the transfer cap makes the best attainable balance deteriorate toward the original surplus as ambiguity vanishes. When only the possible labels are certified, two labels suffice. Suitably balanced partitions can also retain the original cap for nonnegative payments and preserve individual rationality under every realized rule. This last guarantee is impossible in positive-revenue Vickrey states when each agent's preserving distribution has full support. Frequency information therefore changes feasibility, liquidity, and realized participation in distinct ways.

Suggested Citation

  • Hiroaki Odahara, 2026. "Exact Budget Balance via Payment-Rule Ambiguity: Incentive Preservation, Transfer Capacity, and Participation," Papers 2608.00517, arXiv.org.
  • Handle: RePEc:arx:papers:2608.00517
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.00517
    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:2608.00517. 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.