مکانیزم مزایده ترکیبی تأمین تجهیزات عمومی با تخصیص کیفیت
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|17008||2011||13 صفحه PDF||سفارش دهید||14093 کلمه|
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله شامل 14093 کلمه می باشد.
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Decision Support Systems, Volume 51, Issue 3, June 2011, Pages 480–492
This article focuses on mechanism design for quality assignment combinatorial procurement auctions. We model how the participants can maximize social surplus, the difference between gross utility and total cost in electronic procurement, while selecting appropriate quality standards for the procured items. In typical forward combinatorial auctions, the goal is to maximize the sum of all buyers' valuations. In our setting, however, to achieve high buyer utility with low supplier cost, the selected quality levels for the procured items from the suppliers must exceed some predetermined minimum threshold. So the identification of capable suppliers and the corresponding quality assignments are crucial, since buyer utility and supplier cost will be affected by the buyer's quality choice. We develop a novel mechanism to balance the interests of buyers and sellers. Our proposed quality assignment Vickrey–Groves–Clarke (QA-VCG) mechanism is incentive-compatible, provides constraints on partial participation, and is efficient in quasi-linear preferences. In consideration of the perspective of the buyer as a government auctioneer, we also propose a revised mechanism to implement the goal of achieving minimal procurement costs, and appropriate benefits for participating suppliers. We provide a numerical illustration of our QA-VCG mechanism, and an extension that addresses an iterative combinatorial auction mechanism design in our context.
Electronic combinatorial auctions have been applied in a variety of environments involving economic transactions. They have the potential to play an important role in electronic transactions for supply chain management procurement  and other contexts  and . For example, Logistics.com (www.logistics.com) in the transportation and shipping industry has conducted industry-specific B2B procurement combinatorial auctions, and Net Exchange (www.nex.com) has procured transportation services for Sears Logistics . Home Depot regularly uses combinatorial auctions to procure trucking services . Lee et al.  also have reported on an algorithm for optimal combinatorial auction bidding in truck route selection in support of such applications. IBM, which has significant ongoing research at its R&D centers around the world , , , , ,  and , also has been doing procurement through combinatorial auctions on behalf of Mars Incorporated and many other organizations . In many other application settings though, the buyer in an electronic combinatorial auction for supply procurement is not a business enterprise. Municipal, county, provincial, state and central governments, and other public sector organizations are likely to benefit as well  and . Combinatorial auctions can be used to procure services and project help, as well as goods, reflecting the needs of public procurement. We focus on the reverse auction version of combinatorial auctions for public procurement, where the emphasis is on social welfare. Our purpose especially matches the requirements for government auctions that can be held via the Internet in China, where state and private enterprises are involved in procurement, and where this research originated. Recently, for example, Catalan et al.  have studied the practical application of Internet-based combinatorial procurement auctions in the context of the procurement activities for food supplies by the Government of Chile, which provides more than 1.8 million meals daily to public school children at an annual cost of US$360 million. Combinatorial auctions have several features that affect the efficacy of their design: their computational feasibility , their efficiency for winner determination , and the economic efficiency of their mechanism  and . 1 The computational efficiency of winner determination algorithms has been explored in many research articles to date on combinatorial auctions ,  and . Combinatorial auctions are challenging mechanisms to implement effectively. It is hard to solve for exact solutions when the number of suppliers is relatively large , and when there are information asymmetries between the buyer and suppliers . In addition, there are often problems with free riding  on the part of bidders. From the perspective of economics and management science, the central issues that exist in the optimal design of combinatorial auctions are allocation efficiency and revenue maximization (or cost minimization) . Allocation efficiency occurs when both the total value for the winners and the buyer's valuation are maximized, and is a primary goal in auctions involving a government auctioneer, such as the United States Federal Communications Commission for broadcast spectrum and transmission rights in radio networks . Another application area is the procurement auctions of airport commissions for landing and takeoff slots at regional airports . We view allocation efficiency in terms of social surplus maximization from the procurement, from the point of view of both the government and suppliers. Revenue maximization is also important from the perspective of a government, which typically wishes to minimize its total cost of procurement ,  and . However, these goals may contradict each other in different economic settings. For example, this can occur when there is a reserve price that does not permit the auction allocation priority ranking to be in synch with the ordered values of the bids that are made . Krishna and Perry  suggest that a tradeoff is probably necessary in most auction mechanism design cases. Mechanism design is intended to solve the problem of effective auction implementation . It views the marketplace as having self-interested rational agents with private information who act as participating suppliers in an auction. Their private information characterizes the suppliers' cost structure and auction bidder's demeanor. Some typical supplier type descriptors include supplier preferences, the schedule of supplier values for different quantities and qualities, the time in the auction (e.g., early or late or both) when the supplier makes a bid, and so on. The purpose of this paper is to design a mechanism for combinatorial reverse auction-based procurement to achieve maximum social welfare, which has the utilitarian social goal of optimizing total surplus for both the auctioneer and the winning supply bidders. We emphasize that the role of the auctioneer that we wish to model in this work is a government or public entity procurement agent. For clarity related to the procurement in supply chain management, we will refer to bidders as suppliers throughout. The specific characteristics of combinatorial auctions that we will treat in the procurement context involve heterogeneous goods and different quality standards. The property of heterogeneous goods is the same property that we see in normal combinatorial auctions . However, the second property — quality standards assignment — is somewhat unique in procurement auctions. The remainder of this article is organized as follows. Section 2 discusses the background literature and theory on the Vickrey–Clarke–Groves (VCG) mechanism for combinatorial auctions, as a departure point for the remainder of the article. Section 3 presents our proposed variant, a VCG mechanism for combinatorial auctions with the possibility of quality choices to be made by the auction bidders, and with suppliers who have the flexibility to provide different bundles of procurement goods with differing degrees of quality. Section 4 discusses incentive compatibility, and presents our first analytical results to show that the social choice function in our quality assignment VCG mechanism (QA-VCG) can be truthfully-implemented based on identifiable dominant strategies. Section 5 deepens our analysis of the QA-VCG mechanism, by analyzing individual rationality and permitting bidders to decide whether they wish to participate in the auction. Next is Section 6, which discusses the QA-VCG mechanism's performance from the point of view of the auction operator. In Section 7, we present a numerical illustration of the operation of the QA-VCG mechanism. Section 8 extends the results of our QA-VCG mechanism to the case of multi-round auctions, where truth-telling round-by-round is no longer an essential goal. Section 9 concludes with contributions and limitations that can be addressed in future research.
نتیجه گیری انگلیسی
The most important issues in combinatorial auction design are obtaining efficient allocations, achieving revenue maximization and encouraging truthfulness in bidding. Constraints on individual rationality and a balanced budget are of second-order importance. In quality assignment combinatorial procurement auctions, the auctioneer hopes to use the market mechanism to effectively procure goods or services at an attractive price, with reasonable costs and acceptable (if not optimal) quality. The special characteristics we have considered are the evaluation of choice of the quality standard levels for the suppliers' procurement items that the auctioneer wants to purchase. By combining the benefits of the VCG mechanism , ,  and  with quality assignment evaluation, our proposed QA-VCG mechanism provides a useful theoretical extension to prior research, and treats practical issues that arise in public sector combinatorial procurement auctions.