False-name bidding in first-price combinatorial auctions with incomplete information
暂无分享,去创建一个
[1] Vincent Conitzer,et al. Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms , 2010, AAMAS.
[2] M. Whinston,et al. Menu Auctions, Resource Allocation, and Economic Influence , 1986 .
[3] Makoto Yokoo,et al. The effect of false-name bids in combinatorial auctions: new fraud in internet auctions , 2004, Games Econ. Behav..
[4] D. Fudenberg,et al. Perfect Bayesian equilibrium and sequential equilibrium , 1991 .
[5] Michael P. Wellman,et al. STRATEGIC INTERACTIONS IN A SUPPLY CHAIN GAME , 2005, Comput. Intell..
[6] Michael P. Wellman,et al. Searching for approximate equilibria in empirical games , 2008, AAMAS.
[7] Paul R. Milgrom,et al. Putting Auction Theory to Work: The Simultaneous Ascending Auction , 1999, Journal of Political Economy.
[8] Makoto Yokoo,et al. A robust open ascending-price multi-unit auction protocol against false-name bids , 2005, Decis. Support Syst..
[9] Vincent Conitzer,et al. Strategic betting for competitive agents , 2008, AAMAS.
[10] E. Maasland,et al. Auction Theory , 2021, Springer Texts in Business and Economics.
[11] Jean-Francois Richard,et al. Approximation of Nash equilibria in Bayesian games , 2008 .
[12] Michael P. Wellman,et al. Stochastic Search Methods for Nash Equilibrium Approximation in Simulation-based Games , 2022 .
[13] Michel Gendreau,et al. Combinatorial auctions , 2007, Ann. Oper. Res..
[14] W. Greene,et al. 计量经济分析 = Econometric analysis , 2009 .
[15] D. Parkes,et al. Quantifying the Strategyproofness of Mechanisms via Metrics on Payoff Distributions , 2009, UAI.