pith. sign in

arxiv: 1604.04157 · v1 · pith:ENEEF5IDnew · submitted 2016-04-14 · 💻 cs.GT

Note on VCG vs. Price Raising for Matching Markets

classification 💻 cs.GT
keywords marketpricesclearingcompatibleincentivematchingassignmentscorresponding
0
0 comments X
read the original abstract

In \cite{EK10} the use of VCG in matching markets is motivated by saying that in order to compute market clearing prices in a matching market, the auctioneer needs to know the true valuations of the bidders. Hence VCG and corresponding personalized prices are proposed as an incentive compatible mechanism. The same line of argument pops up in several lecture sheets and other documents related to courses based on Easley and Kleinberg's book, seeming to suggest that computing market clearing prices and corresponding assignments were \emph{not} incentive compatible. Main purpose of our note is to observe that, in contrast, assignments based on buyer optimal market clearing prices are indeed incentive compatible.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Envy, Regret, and Social Welfare Loss

    cs.GT 2019-07 unverdicted novelty 6.0

    Introduces IC-Envy metric for auction incentive compatibility that satisfies IC-Envy ≥ IC-Regret in position auctions and ad types, bounds social welfare loss from misreports, and improves ML prediction of regret over...

  2. The Ad Types Problem

    cs.GT 2019-07 unverdicted novelty 6.0

    Faster O(n²(k + log n)) algorithm for ad-types assignment without gap rules, inapproximability within k^{1-ε} with gap rules, and O(k n^{2k+1}) DP for exact solution with discounts.