There are special markets where not all buyers are symmetric from the seller's perspective and similarly, there are cases where not all sellers are symmetric from the buyer's perspective. For example when a person attempts to acquire some information it most definitely matters who the information provider/seller is. The higher the reputation an information provider has the more valuable his information is from the advertisers' perspective. The main challenges in such scenarios are the ability to (i) elicit true information from the participants, and (ii) find the most efficient allocation. The VCG could have been a good mechanism for this purpose, however, it is not budget balanced, making it impractical. In this paper we propose the weighted bilateral VCG mechanism which comprises most of the desired economic properties for being strategy proof, and individually rational. Moreover, our mechanism has been shown to be (i) budget balanced for the long term, (ii) does not add complexity overhead to the optimization problem complexity, (iii) may be tuned by the auctioneer using the weight parameter to decide about the level of profit it decides on, and (iv) produces suboptimal allocations which are very close to the optimal ones.
[1]
J. Munkres.
ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS*
,
1957
.
[2]
Boi Faltings,et al.
A budget-balanced, incentive-compatible scheme for social choice
,
2004,
AAMAS'04.
[3]
Theodore Groves,et al.
Incentives in Teams
,
1973
.
[4]
Ruggiero Cavallo,et al.
Optimal decision-making with minimal waste: strategyproof redistribution of VCG payments
,
2006,
AAMAS '06.
[5]
Vincent Conitzer,et al.
Worst-case optimal redistribution of VCG payments
,
2007,
EC '07.
[6]
Moshe Babaioff,et al.
Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation
,
2003,
EC '03.
[7]
Nicholas R. Jennings,et al.
Redistribution of VCG Payments in Public Project Problems
,
2012,
WINE.
[8]
Harold W. Kuhn,et al.
The Hungarian method for the assignment problem
,
1955,
50 Years of Integer Programming.
[9]
Ashish Goel,et al.
Truthful auctions for pricing search keywords
,
2006,
EC '06.
[10]
S. Muthukrishnan,et al.
General auction mechanism for search advertising
,
2008,
WWW '09.