Shapley-Based Core-Selecting Payment Rules

07/02/2021
by   Vitor Bosshard, et al.
0

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.

READ FULL TEXT
research
04/25/2022

Understanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions

Combinatorial auctions (CAs) allow bidders to express complex preference...
research
05/15/2023

A Note on Rules Achieving Optimal Metric Distortion

In this note, we uncover three connections between the metric distortion...
research
02/24/2020

Selecting and ranking individualized treatment rules with unmeasured confounding

It is common to compare individualized treatment rules based on the valu...
research
11/04/2018

Syntax and Typing for Cedille Core

This document specifies a core version of the type theory implemented in...
research
11/26/2019

A Note on Computational Complexity of Kill-all Go

Kill-all Go is a variant of Go in which Black tries to capture all white...
research
03/04/2022

Approval with Runoff

We define a family of runoff rules that work as follows: voters cast app...
research
05/22/2018

Sensitivity of Regular Estimators

This paper studies local asymptotic relationship between two scalar esti...

Please sign up or login with your details

Forgot password? Click here to reset