Iterative combinatorial auctions: achieving economic and computational efficiency
Iterative combinatorial auctions: achieving economic and computational efficiency
A mechanism for supporting collective innovation: the open contract-based challenge
Information Systems and e-Business Management
Hi-index | 0.00 |
Based on the work of Krishna and Rosenthal (1996) about combinatorial auctions bidding equilibrium analysis and Che’s (1993) research about one-unit multi-attributes auctions, we construct a multi-attributes procurement combinatorial auction (MAPCA) for 2 objects, through a first-score, sealed-bid format. There are two kinds of bidders: n simple bidders and m diverse bidders considered in this model. With some assumptions, we finally obtain the equilibrium bidding strategies for the both two kinds of bidders.