Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2504.14948

Help | Advanced Search

Computer Science > Computer Science and Game Theory

arXiv:2504.14948 (cs)
[Submitted on 21 Apr 2025 ]

Title: Mechanism Design for Auctions with Externalities on Budgets

Title: 具有预算外部性的拍卖机制设计

Authors:Yusen Zheng, Yukun Cheng, Chenyang Xu, Xiaotie Deng
Abstract: This paper studies mechanism design for auctions with externalities on budgets, a novel setting where the budgets that bidders commit are adjusted due to the externality of the competitors' allocation outcomes-a departure from traditional auctions with fixed budgets. This setting is motivated by real-world scenarios, for example, participants may increase their budgets in response to competitors' obtained items. We initially propose a general framework with homogeneous externalities to capture the interdependence between budget updates and allocation, formalized through a budget response function that links each bidder's effective budget to the amount of items won by others. The main contribution of this paper is to propose a truthful and individual rational auction mechanism for this novel auction setting, which achieves an approximation ratio of $1/3$ with respect to the liquid welfare. This mechanism is inspired by the uniform-price auction, in which an appropriate uniform price is selected to allocate items, ensuring the monotonicity of the allocation rule while accounting for budget adjustments. Additionally, this mechanism guarantees a constant approximation ratio by setting a purchase limit. Complementing this result, we establish an upper bound: no truthful mechanism can achieve an approximation ratio better than $1/2$. This work offers a new perspective to study the impact of externalities on auctions, providing an approach to handle budget externalities in multi-agent systems.
Abstract: 本文研究了存在预算外部性的拍卖机制设计,这是一个新的场景,其中竞标者的预算会因竞争对手的分配结果而调整——这与传统固定预算的拍卖不同。 这种设置源于现实场景,例如,参与者可能会因竞争对手获得物品而增加自己的预算。 我们最初提出一个具有同质外部性的通用框架,以捕捉预算更新与分配之间的相互依赖关系,通过一个预算响应函数进行形式化,该函数将每个竞标者的有效预算与其他人赢得的物品数量联系起来。 本文的主要贡献是为这种新型拍卖设置提出一种诚实且个体理性的拍卖机制,其相对于液体福利的近似比为$1/3$。 该机制受到统一价格拍卖的启发,在该拍卖中选择一个适当的统一价格来分配物品,确保分配规则的单调性,同时考虑预算调整。 此外,通过设置购买上限,该机制保证了一个常数近似比。 作为这一结果的补充,我们建立了上界:没有任何诚实机制能实现优于$1/2$的近似比。 这项工作提供了一个新的视角来研究外部性对拍卖的影响,为处理多智能体系统中的预算外部性提供了一种方法。
Subjects: Computer Science and Game Theory (cs.GT)
Cite as: arXiv:2504.14948 [cs.GT]
  (or arXiv:2504.14948v1 [cs.GT] for this version)
  https://doi.org/10.48550/arXiv.2504.14948
arXiv-issued DOI via DataCite

Submission history

From: Yusen Zheng [view email]
[v1] Mon, 21 Apr 2025 08:11:21 UTC (37 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs.GT
< prev   |   next >
new | recent | 2025-04
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号