This paper complements the main experimental result reported in Takahashi et al. (Evolut Inst Econ Rev 16:357–374, 2019) to a deeper understanding of subjects’ bidding behavior under the VCG mechanism. In the experiment, there are two types of appearance of information about bidders’ valuations of the item given to them and the bids they are asked to submit: one is unit valuations and the unit bids themselves (Appearance 1) and the other is unit valuations and the unit bids multiplied by the number of units (Appearance 2). For subjects who compete with truth-telling machine bidders in multi-unit auctions, we confirmed that in Appearance 1, they choose truth-telling bids more frequently, and efficient allocations are observed more frequently, as compared to the situation where they compete with human bidders. This result suggests a possibility that in Appearance 1, subjects learn their dominant strategy not by practicing with other subjects but by practicing with machine bidders in experiments for multi-unit auctions, although the item allocation and payment determination under the VCG mechanism is never intuitively understandable to the subjects.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
The complete instruction is attached in Appendix 2.
For the case of two units of an item being auctioned off to two bidders, Engelmann and Grimm (2009) compared the performances of a uniform-price sealed-bid auction, a uniform-price clock auction, a discriminatory auction, a static Vickrey auction, and a dynamic Vickrey auction, as well as conducting a literature review on laboratory experiments of multi-unit auctions. Among the studies in the literature review, Kagel and Levin (2001) was a seminal paper studying the demand reduction in uniform-price auctions. Since then, experiments on multi-unit auctions have focused on demand reduction under uniform-price.
This is a part of instructions for the participants in sessions for Appearance 1.
In the instructions, we explained how the VCG mechanism allocates the item with this example for 3 units, to reduce the influence of the numerical values on the behavior of our subjects in the auctions for 5 units.
Dyer ME (1984) An O\((n)\) algorithm for the multiple-choice knapsack linear program. Math Program 29:57–63
Engelmann D, Grimm V (2009) Bidding behavior in multi-unit auctions—an experimental investigation. Econ J 119:855–882
Kagel JH, Levin D (2001) Behavior in multi-unit demand auctions: experiments with uniform price and dynamic Vickrey auctions. Econometrica 69:413–451
Kagel JH, Levin D (2016) Auctions: a survey of experimental research. In: Kagel JH, Roth AE (eds) Handbook of experimental economics, vol II. Princeton University Press, Princeton, pp 563–637
Kagel JH, Kinross S, Levin D (2001) Comparing efficient multi-object auction institutions. mimeo. Ohio State University
Kothari A, Parkes DC, Suri S (2005) Approximately-strategy proof and tractable multi-unit auctions. Decis Support Syst 39:105–121
Takahashi S, Shigeno M (2011) Approximation algorithms for a winner determination problem of single-item multi-unit auctions. JSIAM Lett 3:29–32
Takahashi S, Izunaga Y, Watanabe N (2018) An approximation algorithm for multi-unit auctions: numerical and subject experiments. Oper Res Decis 28:75–95
Takahashi S, Izunaga Y, Watanabe N (2019) VCG mechanism for multi-unit auctions and appearance of information: a subject experiment. Evolut Inst Econ Rev 16:357–374
The authors wish to thank Toru Suzuki for his excellent research assistance.
This research was supported by JSPS Grants-in-Aid for Scientific Research (B) 15H02972 and 20H04146 (Takahashi), and the Japan Center for Economic Research, ORA-Plus research project “BEAM”, and JSPS Grant-in-Aid for Challenging Research (Pioneering) 17H06190 (Watanabe).
Conflict of interest
The authors declare that they have no conflict of interest.
All procedures performed in studies involving human participants were in accordance with the ethical standards of the institutional and/or national research committee and with the 1964 Helsinki declaration and its later amendments or comparable ethical standards. This article does not contain any studies with animals performed by any of the authors.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix 1: Bid plots and regression results
Appendix 2: Instruction
Footnote 3 Welcome to this experiment!
Thank you very much for taking the time to participate in our auction experiment. The experiment lasts for about 100 min, including the payment session.
1.1 At first
Please follow the instructions given by the experiment administrators.
Please remain silent, and do not talk to or exchange notes with other participants.
Please do not look at what other participants are doing.
Please do not change your position. Please do not lean in your chair.
Please do NOT do anything other than what you are instructed to do.
Please turn off and refrain from using your cell phones.
Please quietly raise your hand if you have questions or need help.
In this experiment, a total of 20 auctions will be held and 5 units of a virtual item are auctioned off to 3 bidders in each auction.
After all the 20 auctions end, a computer will randomly choose 3 auctions each from the 10 auctions in the first and second halves, that is, a total of 6 auctions. You will be compensated on the basis of the total points you earned in the 6 auctions. The final compensation will be the amount based on those points in addition to a compensation of 1500 JPY for participation.
1.3 Group selection
At the beginning, you will be assigned an ID. Your ID will remain the same throughout the session you participate in, and it will be displayed on your computer screen. You will be matched with 2 machine bidders. During the experiment, this matching will be fixed.
Please raise your hand if you have questions on the above contents.
In each auction, 5 units of an identical item are auctioned off to 3 bidders; one is you and the other two are machine bidders. The bidding strategy of each machine bidder is programmed in advance. Please bid for all units within 120 s. If no one in the same group bids within this time limit, all bidders in the group obtain zero points. The outcome will not be shown until the remaining time is up, even if everyone bids within the time limit.
At the beginning of each auction, each bidder is given unit valuations of the item for each unit. When the unit valuation is, e.g., 15 for 3 units, the total valuation is \(15\times 3=45\). You are asked to submit your unit bids for each unit. Please press the “bid” button after you fill in your unit bids on your screen. Then, a pop-up window appears and shows your total bids for each unit. If you click on the “OK” button in the pop-up window, your bids will then be sent to the server computer to compute the outcome of the auction. If you click on the “cancel” button there, you can then go back to the screen for filling in your unit bids.
For each bidder, unit valuations are drawn as integers independently of those for the other bidders with equal probability between 1 and 200. Please bid in non-negative integers. The remaining time is displayed in the right upper corner of your screen. When the auction ends, the outcome is shown on your screen. The next auction will start after 5 s. The rule of the auction is explained next.
Please raise your hand if you have questions on the above content.
1.5 Item allocation in the auction
Below is an example of an auction in which 3 units of an item are auctioned off to 2 bidders. In Table 12, valuations (or bids) are displayed as unit valuations (or unit bids) multiplied by the number of units.Footnote 4 Note that the unit valuations and unit bids shown in this example do not suggest any bidding strategy in the auctions you will participate in.
The item will be allocated to bidders, such that the total amount of bids is maximized as follows. Find an allocation that maximizes the total amount of bids among all possible allocations. In the example, (0, 0): 0, (1, 1): \(70\times 1+40\times 1=110\), (1, 0): \(70\times 1=70\), (2, 0): \(55\times 2=110\), (3, 0): \(50\times 3=150\), (0, 1): \(40 \times 1=40\), (0, 2): \(6 \times 2=120\), (0, 3): \(65 \times 3=195\), (1, 2): \(70\times 1+60\times 2=190\), (2,1): \(55 \times 2+40\times 1 =150\). Thus, this auction allocates 3 units to bidder 2. The total amount of bids is 195. When there are two or more allocations that maximize the total amount of bids, one of those allocations is chosen at random.
1.6 Payment determination in the auction
The payments of bidders are determined as follows.
Payment of bidder i \(=\) (total amount of bids in the auction that excludes bidder i):
(total amount of bids in the auction) \(+\) (bidder i’s bid for the unit assigned to i).
In the example:
payment of bidder 1 \(=(65\times 3)-195+0=0\).
payment of bidder 2 \(=(50\times 3)-195+(65\times 3)=150\).
The amount of points each bidder earns is calculated as follows.
Bidder i’s points \(=\) (total valuation for the units bidder i is allocated)
(payment of bidder i).
In the example,
bidder 1’s points \(=0-0=0\).
bidder 2’s points \(=(65\times 3)-150=45\).
You will be compensated on the basis of the points you earned. The exchange rate is 1 point \(=\) 1 JPY. As mentioned, you will be compensated on the basis of the total points you earned in the 6 auctions, 3 out of the first 10 auctions, and 3 out of the second 10 auctions.
In the first 10 auctions, unit valuations are given on your computer screen and you are asked to submit unit bids there, as shown in the Example (Table 12). In the second 10 auctions, total valuations are given on your screen and you are asked to submit total bids there, as shown in Table 13.
At the beginning of each sequence of 10 auctions, an additional auction is held as a practice, so that you can familiarize yourself with how to do with the computer. The points you earn in the practice auctions will not be among those counted for the compensation.
Please raise your hand if you have questions.
About this article
Cite this article
Takahashi, S., Izunaga, Y. & Watanabe, N. An experimental study of VCG mechanism for multi-unit auctions: competing with machine bidders. Evolut Inst Econ Rev 19, 97–117 (2022). https://doi.org/10.1007/s40844-021-00198-1