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

From the Social Choice Problem to a Collusion-Proof Tendering Mechanism for Dynamic Stochastic Projects

Author

Listed:
  • Endre Cs'oka

Abstract

The VCG family and the AGV mechanism are two classical approaches to efficient implementation in the static social choice problem. In 2024, Cs\'oka et al. showed that AGV has critical weaknesses. In contrast, the transferable-utility Guaranteed Utility Mechanism (TU-GUM) retains all the standard desirable properties of AGV while adding further ones, including collusion-proofness, because it implements efficiency in Guaranteed Utility Equilibrium. TU-GUM also applies to a more general dynamic setting with multiple extensions. Moreover, TU-GUM is a special case of an even more general and robust mechanism that combines contingent first-price tendering with the coordinated execution of dynamic stochastic multi-agent projects through a surprisingly simple rule. This paper summarizes and connects existing results from a different perspective, with some minor new observations.

Suggested Citation

  • Endre Cs'oka, 2026. "From the Social Choice Problem to a Collusion-Proof Tendering Mechanism for Dynamic Stochastic Projects," Papers 2608.28722, arXiv.org.
  • Handle: RePEc:arx:papers:2608.28722
    as

    Download full text from publisher

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