暂无分享,去创建一个
[1] Mohammad Taghi Hajiaghayi,et al. Automated Online Mechanism Design and Prophet Inequalities , 2007, AAAI.
[2] Paul Dütting,et al. Payment Rules through Discriminant-Based Classifiers , 2012, ACM Trans. Economics and Comput..
[3] Nicolas Vieille,et al. Optimal dynamic information provision , 2014, Games Econ. Behav..
[4] Hanrui Zhang,et al. Automated Mechanism Design for Classification with Partial Verification , 2021, AAAI.
[5] Vincent Conitzer,et al. Competitive Repeated Allocation without Payments , 2009, WINE.
[6] Siddhartha Banerjee,et al. From Monetary to Non-Monetary Mechanism Design via Artificial Currencies , 2017, EC.
[7] Vincent Conitzer,et al. The Revelation Principle for Mechanism Design with Reporting Costs , 2016, EC.
[8] Branislav Bosanský,et al. Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games , 2015, AAAI.
[9] Branislav Bosanský,et al. Finite State Machines Play Extensive-Form Games , 2020, EC.
[10] Paul Dütting,et al. Optimal auctions through deep learning , 2017, ICML.
[11] Ronald A. Howard,et al. Dynamic Programming and Markov Processes , 1960 .
[12] Vincent Conitzer,et al. Self-interested automated mechanism design and implications for optimal combinatorial auctions , 2004, EC '04.
[13] Jakub Cerný,et al. Incremental Strategy Generation for Stackelberg Equilibria in Extensive-Form Games , 2018, EC.
[14] B. Stengel,et al. Efficient Computation of Behavior Strategies , 1996 .
[15] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[16] Rupak Majumdar,et al. Bayesian Persuasion in Sequential Decision-Making , 2021, ArXiv.
[17] I. Segal,et al. Dynamic Mechanism Design: A Myersonian Approach , 2014 .
[18] R. Myerson. MULTISTAGE GAMES WITH COMMUNICATION , 1984 .
[19] Vincent Conitzer,et al. Dynamic Proportional Sharing: A Game-Theoretic Approach , 2018, SIGMETRICS.
[20] R. Bellman. A Markovian Decision Process , 1957 .
[21] Ilya Segal,et al. An Efficient Dynamic Mechanism , 2013 .
[22] D. Koller,et al. Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .
[23] Vincent Conitzer,et al. Complexity of Mechanism Design with Signaling Costs , 2015, AAMAS.
[24] D. Bergemann,et al. Dynamic Mechanism Design: An Introduction , 2017, Journal of Economic Literature.
[25] S. Matthew Weinberg,et al. A Permutation-Equivariant Neural Network Architecture For Auction Design , 2021, AAAI.
[26] Péter Eso,et al. Optimal Information Disclosure in Auctions and the Handicap Auction , 2007 .
[27] Itai Ashlagi,et al. Sequential Mechanisms with Ex-post Participation Guarantees , 2016, EC.
[28] A. Pavan. Dynamic Mechanism Design: Robustness and Endogenous Types , 2015 .
[29] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[30] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[31] D. P. Baron,et al. Regulation and information in a continuing relationship , 1984 .
[32] Maria-Florina Balcan,et al. Sample Complexity of Automated Mechanism Design , 2016, NIPS.
[33] Eric Allender,et al. Complexity of finite-horizon Markov decision process problems , 2000, JACM.
[34] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[35] V. Vazirani,et al. Algorithmic Game Theory: Basic Solution Concepts and Computational Issues , 2007 .
[36] D. Bergemann,et al. The Dynamic Pivot Mechanism , 2008 .
[37] David C. Parkes,et al. Automated Mechanism Design without Money via Machine Learning , 2016, IJCAI.
[38] Maria-Florina Balcan,et al. A General Theory of Sample Complexity for Multi-Item Profit Maximization , 2017, EC.
[39] Branislav Bosanský,et al. Computation of Stackelberg Equilibria of Finite Sequential Games , 2015, WINE.
[40] Branislav Bosanský,et al. Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games , 2016, AAAI.
[41] David C. Parkes,et al. Deep Learning for Revenue-Optimal Auctions with Budgets , 2018, AAMAS.
[42] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[43] P. Courty,et al. Sequential Screening , 1998 .
[44] Tuomas Sandholm,et al. Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead , 2017, AAAI.
[45] Pingzhong Tang,et al. Automated Mechanism Design via Neural Networks , 2018, AAMAS.
[46] Tuomas Sandholm,et al. Automated Design of Revenue-Maximizing Combinatorial Auctions , 2015, Oper. Res..
[47] Vincent Conitzer,et al. Computing optimal strategies to commit to in extensive-form games , 2010, EC '10.
[48] M. Puterman,et al. Modified Policy Iteration Algorithms for Discounted Markov Decision Problems , 1978 .
[49] Vincent Conitzer,et al. Automated Design of Multistage Mechanisms , 2007, IJCAI.
[50] Nicola Gatti,et al. Private Bayesian Persuasion with Sequential Games , 2020, AAAI.
[51] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[52] Renato Paes Leme,et al. Non-clairvoyant Dynamic Mechanism Design , 2018, EC.
[53] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[54] Peng Sun,et al. Multiagent Mechanism Design Without Money , 2019, Oper. Res..