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

Credibility Trilemma in Polymatroidal Service Markets

Author

Listed:
  • Lauri Lov'en
  • Sujit Gujar
  • Kalle Timperi
  • Hassan Mehmood
  • Praveen Kumar Donta
  • Sasu Tarkoma
  • Schahram Dustdar

Abstract

Mechanism-mediated service markets with polymatroidal feasibility admit efficient, dominant-strategy incentive-compatible (DSIC) allocation, but these guarantees implicitly assume truthful execution by the marketplace operator. Modelling the operator as a strategic player, we establish a credibility trilemma: for single-parameter agents on a non-modular polymatroid carrying a competitive prior profile, no static sealed-bid mechanism is simultaneously revenue-optimal, DSIC for agents, and credible for the operator. We introduce the Cost of Non-Credibility (CoNC) as a price-of-anarchy-style welfare-loss measure and prove a per-triple lower bound scaling with the polymatroid's conditional non-modularity gap; on released instances where capacity binds, its deviation extracts under 0.02% of welfare and phantom insertion 0.9-2.2%, neither destroying welfare. Two resolutions follow: public broadcast or deferred-revelation commitment, and administrative domain separation under settlement separation and four side conditions. On the supply side, an integrator paid a share of its slice's payments can profitably understate capacity, which settlement separation does not prevent and a known-cost envelope rule does. An instance-level grounding over the edge-pricing market of Amin et al. proves the trilemma there and shows that settlement separation closes its price-perturbation channel. Marketplace neutrality is thus a first-order design constraint on polymatroidal service markets.

Suggested Citation

  • Lauri Lov'en & Sujit Gujar & Kalle Timperi & Hassan Mehmood & Praveen Kumar Donta & Sasu Tarkoma & Schahram Dustdar, 2026. "Credibility Trilemma in Polymatroidal Service Markets," Papers 2605.26604, arXiv.org, revised Oct 2026.
  • Handle: RePEc:arx:papers:2605.26604
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Dirk Bergemann & Stephen Morris, 2012. "Robust Mechanism Design," World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 2, pages 49-96, World Scientific Publishing Co. Pte. Ltd..
    2. McAfee, R. Preston, 1992. "A dominant strategy double auction," Journal of Economic Theory, Elsevier, vol. 56(2), pages 434-450, April.
    3. Eric J. Friedman* & Paul Resnick, 2001. "The Social Cost of Cheap Pseudonyms," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 10(2), pages 173-199, June.
    4. Jehiel, Philippe & Moldovanu, Benny, 2001. "Efficient Design with Interdependent Valuations," Econometrica, Econometric Society, vol. 69(5), pages 1237-1259, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wei He & Jiangtao Li & Weijie Zhong, 2024. "Rank-Guaranteed Auctions," Papers 2408.12001, arXiv.org.
    2. Dirk Bergemann & Marek Bojko & Paul DŸtting & Renato Paes Leme & Haifeng Xu & Song Zuo, 2024. "Data-Driven Mechanism Design: Jointly Eliciting Preferences and Information," Cowles Foundation Discussion Papers 2418, Cowles Foundation for Research in Economics, Yale University.
    3. Satterthwaite, Mark A. & Williams, Steven R. & Zachariadis, Konstantinos E., 2014. "Optimality versus practicality in market design: A comparison of two double auctions," Games and Economic Behavior, Elsevier, vol. 86(C), pages 248-263.
    4. Mathevet, Laurent & Taneva, Ina, 2013. "Finite supermodular design with interdependent valuations," Games and Economic Behavior, Elsevier, vol. 82(C), pages 327-349.
    5. Aditya Vikram, 2024. "Worst-case efficient and budget-balanced mechanism for single-object allocation with interdependent values," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 62(1), pages 89-108, February.
    6. Sushil Bikhchandani & Shurojit Chatterjee & Arunava Sen, 2004. "Incentive Compatibility in Multi-unit Auctions," Levine's Bibliography 122247000000000750, UCLA Department of Economics.
    7. Che,Y.-K. & Kim,J., 2004. "Collusion-proof implementation of optimal mechanisms," Working papers 4, Wisconsin Madison - Social Systems.
    8. Daske, Thomas, 2019. "Efficient Incentives in Social Networks: "Gamification" and the Coase Theorem," EconStor Preprints 193148, ZBW - Leibniz Information Centre for Economics.
    9. Kwanghyun Kim, 2024. "On the existence of efficient multilateral trading mechanisms with interdependent values," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(2), pages 579-608, June.
    10. Philippe Jehiel & Moritz Meyer-ter-Vehn & Benny Moldovanu & William R. Zame, 2006. "The Limits of ex post Implementation," Econometrica, Econometric Society, vol. 74(3), pages 585-610, May.
    11. Philippe Jehiel & Benny Moldovanu, 2005. "Allocative and Informational Externalities in Auctions and Related Mechanisms," Levine's Bibliography 784828000000000490, UCLA Department of Economics.
    12. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
    13. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2022. "Restricted environments and incentive compatibility in interdependent values models," Games and Economic Behavior, Elsevier, vol. 131(C), pages 1-28.
    14. Bolton, Gary E. & Ockenfels, Axel, 2012. "Behavioral economic engineering," Journal of Economic Psychology, Elsevier, vol. 33(3), pages 665-676.
    15. Baliga Sandeep & Vohra Rakesh, 2003. "Market Research and Market Design," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 3(1), pages 1-27, August.
    16. Liu, Heng, 2018. "Efficient dynamic mechanisms in environments with interdependent valuations: the role of contingent transfers," Theoretical Economics, Econometric Society, vol. 13(2), May.
    17. Gärtner, Dennis L. & Schmutzler, Armin, 2009. "Merger negotiations and ex-post regret," Journal of Economic Theory, Elsevier, vol. 144(4), pages 1636-1664, July.
    18. Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.
    19. Philippe Jehiel & Moritz Meyer-ter-Vehn & Benny Moldovanu, 2008. "Ex-post implementation and preference aggregation via potentials," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 37(3), pages 469-490, December.
    20. Loertscher, Simon & Mezzetti, Claudio, 2021. "A dominant strategy, double clock auction with estimation-based tatonnement," Theoretical Economics, Econometric Society, vol. 16(3), July.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:2605.26604. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.