English

Shapley-Based Core-Selecting Payment Rules

Computer Science and Game Theory 2021-07-05 v1

Abstract

In this research note, we lay some groundwork for analyzing the manipulability of core-selecting payment rules in combinatorial auctions. In particular, we focus on payment rules based on the bidders' Shapley values. We define a sensitivity metric, and provide analytical results for this metric in LLG, for six different payment vectors used as reference points for minimum-revenue core-selecting payment rules. We furthermore show how this sensitivity affects the derivative of the resulting payment rules.

Cite

@article{arxiv.2107.01048,
  title  = {Shapley-Based Core-Selecting Payment Rules},
  author = {Vitor Bosshard and Sven Seuken},
  journal= {arXiv preprint arXiv:2107.01048},
  year   = {2021}
}

Comments

Research Note

R2 v1 2026-06-24T03:50:36.558Z