Foundations of platform-assisted auctions (Q6863968)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8154818
Language Label Description Also known as
default for all languages
No label defined
    English
    Foundations of platform-assisted auctions
    scientific article; zbMATH DE number 8154818

      Statements

      Foundations of platform-assisted auctions (English)
      0 references
      0 references
      0 references
      0 references
      4 February 2026
      0 references
      It is known that, the auction theory literature mainly focuses on designing auctions that incentivize the buyers to bid truthfully, assuming that the platform always faithfully implements the auction. In practice, however, the platforms have been found to manipulate the auctions to earn more profit, resulting in high-profile anti-trust lawsuits.\N\NIn this paper a new model for studying platform-assisted auctions in the permissionless setting, where anyone can register and participate in the auction is proposed. More precisely the authors show how cryptography can lend to the design of an efficient platform-assisted auction with dream properties. A new notion of simulation called utility-dominated emulation that is sufficient for guaranteeing the game-theoretic properties needed in an auction is proposed. Under this new notion of simulation, the authors show how to design efficient auction protocols with quasilinear efficiency, which gives an \(n\)-fold improvement over any generic approach where \(n\) is the number of buyers.\N\NFor the entire collection see [Zbl 08084026].
      0 references
      platform-assisted auctions
      0 references
      utility-dominated emulation
      0 references
      efficient auction protocols with quasi-linear efficiency
      0 references
      efficient platform-assisted auction
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references