| 具有计算复杂性的VCG机制投标策略研究 |
| |
| 引用本文： | 黄河,陈剑. 具有计算复杂性的VCG机制投标策略研究[J]. 管理学报, 2008, 5(4): 505-510 |
| |
| 作者姓名： | 黄河 陈剑 |
| |
| 作者单位： | 重庆大学经济与工商管理学院,重庆市,400030;清华大学经济管理学院 |
| |
| 摘 要： | 在组合拍卖的获胜者确定问题(WDP)具有计算复杂性的情况下,研究了相应的VCG机制中投标者的投标策略问题。通过提出2类重要概率,描述了投标者对于VCG机制WDP算法和其真实估价对于组合拍卖分配效率的信念。通过建模分析,揭示了在具有计算复杂性的VCG机制中,上述2类重要概率、投标者获胜后事后效用、跳投标增量与投标策略之间的确定性关系。
|
| 关 键 词： | VCG机制 投标策略 组合拍卖 |
Bidding Strategies for VCG Mechanism with Computational Complexity |
| |
| HUANG He,CHEN Jian. Bidding Strategies for VCG Mechanism with Computational Complexity[J]. Chinese JOurnal of Management, 2008, 5(4): 505-510 |
| |
| Authors: | HUANG He CHEN Jian |
| |
| Abstract: | Considered was combinatorial actions' winners determination problem(WDP) with computational complexity.Bidding strategies of VCG mechanism were studied.Two types of essential probabilities is presented to indicate bidders' belief in WDP algorithm and the effects on his/her value on the allocation efficiency.Some deterministic relationships among the two probabilities,ex-post winning utility,ump bidding increment and bidding strategies in the VCG were explained by using the models and corresponding propositions. |
| |
| Keywords: | VCG mechanism bidding strategy combinatorial auctions |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
