2000 character limit reached
Shapley-Based Core-Selecting Payment Rules
Published 2 Jul 2021 in cs.GT | (2107.01048v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.