Derandomization of auctions
暂无分享,去创建一个
Amos Fiat | Nicole Immorlica | Madhu Sudan | Jason D. Hartline | Gagan Aggarwal | Andrew V. Goldberg
[1] Amos Fiat,et al. Derandomization of auctions , 2005, STOC '05.
[2] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[3] Tim Roughgarden,et al. Optimal mechanism design and money burning , 2008, STOC.
[4] Maria-Florina Balcan,et al. Mechanism design via machine learning , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[5] H. Moulin. Incremental cost sharing: Characterization by coalition strategy-proofness , 1999 .
[6] Avrim Blum,et al. Near-optimal online auctions , 2005, SODA '05.
[7] Heribert Vollmer,et al. On the Autoreducibility of Random Sequences , 2000, SIAM J. Comput..
[8] J. Mirrlees. An Exploration in the Theory of Optimum Income Taxation an Exploration in the Theory of Optimum Income Taxation L Y 2 , 2022 .
[9] Vijay Kumar,et al. Online learning in online auctions , 2003, SODA '03.
[10] Todd Ebert,et al. Applications of recursive operators to randomness and complexity , 1998 .
[11] Nicole Immorlica,et al. Computing with strategic agents , 2005 .
[12] Ilan Newman,et al. A New Derandomization of Auctions , 2009, SAGT.
[13] William J. Cook,et al. Combinatorial optimization , 1997 .
[14] Amos Fiat,et al. Competitive generalized auctions , 2002, STOC '02.
[15] Andrew V. Goldberg,et al. Competitive auctions and digital goods , 2001, SODA '01.
[16] Jason D. Hartline,et al. From optimal limited to unlimited supply auctions , 2005, EC '05.
[17] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[18] Ilya Segal,et al. Optimal Pricing Mechanisms with Unknown Demand , 2002 .
[19] Éva Tardos,et al. Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.