暂无分享,去创建一个
[1] A. Tversky,et al. Judgment under Uncertainty: Heuristics and Biases , 1974, Science.
[2] A. P. Dawid,et al. Maximum Likelihood Estimation of Observer Error‐Rates Using the EM Algorithm , 1979 .
[3] Christian M. Ernst,et al. Multi-armed Bandit Allocation Indices , 1989 .
[4] J. Bather,et al. Multi‐Armed Bandit Allocation Indices , 1990 .
[5] A. Tversky,et al. Loss Aversion in Riskless Choice: A Reference-Dependent Model , 1991 .
[6] D. Putler. Incorporating Reference Price Effects into a Theory of Consumer Choice , 1992 .
[7] Michihiro Kandori. Social Norms and Community Enforcement , 1992 .
[8] G. Kalyanaram,et al. Empirical Generalizations from Reference Price Research , 1995 .
[9] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[10] Paul Resnick,et al. Reputation systems , 2000, CACM.
[11] Frank Thomson Leighton,et al. The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[12] N. Williams. On Dynamic Principal-Agent Problems in Continuous Time , 2004 .
[13] Yuliy Sannikov. A Continuous-Time Version of the Principal-Agent , 2005 .
[14] Chrysanthos Dellarocas,et al. Reputation Mechanism Design in Online Trading Environments with Pure Moral Hazard , 2005, Inf. Syst. Res..
[15] Koby Crammer,et al. Learning from Data of Variable Quality , 2005, NIPS.
[16] Moshe Babaioff,et al. Combinatorial agency , 2006, EC '06.
[17] Vincent Conitzer,et al. Learning algorithms for online principal-agent problems (and selling goods online) , 2006, ICML.
[18] Koby Crammer,et al. Learning from Multiple Sources , 2006, NIPS.
[19] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[20] Ioana Popescu,et al. Dynamic Pricing Strategies with Reference Effects , 2007, Oper. Res..
[21] E. Friedman,et al. Algorithmic Game Theory: Manipulation-Resistant Reputation Systems , 2007 .
[22] K. Arrow,et al. The New Palgrave Dictionary of Economics , 2020 .
[23] Richard H. Thaler,et al. Mental Accounting and Consumer Choice , 1985, Mark. Sci..
[24] Eli Upfal,et al. Multi-Armed Bandits in Metric Spaces ∗ , 2008 .
[25] Csaba Szepesvári,et al. Online Optimization in X-Armed Bandits , 2008, NIPS.
[26] Panagiotis G. Ipeirotis,et al. Get another label? improving data quality and data mining using multiple, noisy labelers , 2008, KDD.
[27] Ohad Shamir,et al. Vox Populi: Collecting High-Quality Labels from a Crowd , 2009, COLT.
[28] Joseph Naor,et al. The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..
[29] Duncan J. Watts,et al. Financial incentives and the "performance of crowds" , 2009, HCOMP '09.
[30] Omar Besbes,et al. Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms , 2009, Oper. Res..
[31] Pietro Perona,et al. The Multidimensional Wisdom of Crowds , 2010, NIPS.
[32] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.
[33] Csaba Szepesvári,et al. –armed Bandits , 2022 .
[34] Kevin D. Glazebrook,et al. Multi-Armed Bandit Allocation Indices: Gittins/Multi-Armed Bandit Allocation Indices , 2011 .
[35] Krzysztof Z. Gajos,et al. Platemate: crowdsourcing nutritional analysis from food photographs , 2011, UIST.
[36] Ioana Popescu,et al. Dynamic Pricing with Loss Averse Consumers and Peak-End Anchoring , 2010, Oper. Res..
[37] Aleksandrs Slivkins,et al. Contextual Bandits with Similarity Information , 2009, COLT.
[38] Chris Callison-Burch,et al. Crowdsourcing Translation: Professional Quality from Non-Professionals , 2011, ACL.
[39] Nikhil R. Devanur,et al. Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.
[40] Krzysztof Z. Gajos,et al. Human computation tasks with global constraints , 2012, CHI.
[41] Thomas Pfeiffer,et al. Adaptive Polling for Information Aggregation , 2012, AAAI.
[42] Mihaela van der Schaar,et al. Towards Social Norm Design for Crowdsourcing Markets , 2012, HCOMP@AAAI.
[43] Sébastien Bubeck,et al. Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..
[44] Omar Besbes,et al. Blind Network Revenue Management , 2011, Oper. Res..
[45] Nicholas R. Jennings,et al. Efficient Crowdsourcing of Unknown Experts using Multi-Armed Bandits , 2012, ECAI.
[46] Bin Bi,et al. Iterative Learning for Reliable Crowdsourcing Systems , 2012 .
[47] Chien-Ju Ho,et al. Online Task Assignment in Crowdsourcing Markets , 2012, AAAI.
[48] Mihaela van der Schaar,et al. Reputation-based incentive protocols in crowdsourcing applications , 2011, 2012 Proceedings IEEE INFOCOM.
[49] Robert D. Kleinberg,et al. Learning on a budget: posted price mechanisms for online procurement , 2012, EC '12.
[50] Siddharth Suri,et al. Conducting behavioral research on Amazon’s Mechanical Turk , 2010, Behavior research methods.
[51] Yaron Singer,et al. Pricing mechanisms for crowdsourcing markets , 2013, WWW.
[52] Yu-An Sun,et al. The Effects of Performance-Contingent Financial Incentives in Online Labor Markets , 2013, AAAI.
[53] Chien-Ju Ho. Adaptive Contract Design for Crowdsourcing , 2013 .
[54] Patrick Hummel,et al. Learning and incentives in user-generated content: multi-armed bandits with endogenous arms , 2013, ITCS '13.
[55] Aleksandrs Slivkins,et al. Bandits with Knapsacks , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[56] Panagiotis G. Ipeirotis,et al. Repeated labeling using multiple noisy labelers , 2012, Data Mining and Knowledge Discovery.
[57] Chien-Ju Ho,et al. Adaptive Task Assignment for Crowdsourced Classification , 2013, ICML.
[58] Ittai Abraham,et al. Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem , 2013, COLT.
[59] Panagiotis G. Ipeirotis,et al. Quality-Based Pricing for Crowdsourced Workers , 2013 .
[60] Aleksandrs Slivkins,et al. Bandits with Knapsacks: Dynamic procurement for crowdsourcing∗ , 2013 .
[61] Ariel D. Procaccia,et al. Better Human Computation Through Principled Voting , 2013, AAAI.
[62] Michael S. Bernstein,et al. The future of crowd work , 2013, CSCW.
[63] Yuliy Sannikov. Advances in Economics and Econometrics: Contracts: The Theory of Dynamic Principal–Agent Relationships and the Continuous-Time Approach , 2013 .
[64] Luciano Messori. The Theory of Incentives I: The Principal-Agent Model , 2013 .
[65] Andreas Krause,et al. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms , 2013, WWW.
[66] Harikesh Nair,et al. Homogenous Contracts for Heterogeneous Agents: Aligning Salesforce Composition and Compensation , 2014 .
[67] Walter S. Lasecki,et al. Legion scribe: real-time captioning by non-experts , 2014, ASSETS.
[68] Aleksandrs Slivkins,et al. Adaptive contract design for crowdsourcing markets: bandit algorithms for repeated principal-agent problems , 2014, J. Artif. Intell. Res..
[69] Devavrat Shah,et al. Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems , 2011, Oper. Res..
[70] Moshe Babaioff,et al. Dynamic Pricing with Limited Supply , 2011, ACM Trans. Economics and Comput..
[71] Harikesh S. Nair,et al. Homogeneous Contracts for Heterogeneous Agents: Aligning Sales Force Composition and Compensation , 2016 .
[72] E. Friedman,et al. Algorithmic Game Theory: Manipulation-Resistant Reputation Systems , 2007 .