Elici%ng Informa%on from the Crowd a Part of the EC 13 Tutorial on Social Compu%ng and User- Generated Content
|
|
- Erica Webb
- 5 years ago
- Views:
Transcription
1 Elici%ng Informa%on from the Crowd a Part of the EC 13 Tutorial on Social Compu%ng and User- Generated Content Yiling Chen Harvard University June 16, 2013
2 Roadmap Elici%ng informa%on for events with verifiable outcomes Proper scoring rules Market scoring rules Elici%ng unverifiable informa%on Peer predic%on Bayesian Truth Serum Robust Bayesian Truth Serum
3 How to Evaluate Weather Forecasts p 1 p Specifica%on of a scale of goodness for weather forecasts the forecaster may oten find himself in the posi%on of choosing to let it (the verifica%on system) do the forecas%ng for him by hedging or playing the system. one essen%al criterion for sa%sfactory verifica%on is that the verifica%on scheme should influence the forecaster in no undesirable way [Brier 1950]
4 The Brier Scoring Rule [Brier 1950] p 1 p S(p, sunny) = 1 (1 p) 2 S(p, rainy) = 1 p 2 Expected score of predic%on S(p, q) =qs(p, sunny) + (1 =1 q(1 p) 2 (1 q)p 2 p =1 q + q 2 (p q) 2 given belief q q)s(p, rainy) Predic%ng q maximizes the expected score arg max S(p, q) =q p S(p, q) increases as p q decreases.
5 The Brier Scoring Rule State Predic%on! 2 {1, 2,...,n} p =(p 1,p 2,...,p n ) Brier score for predic%on in state! is Also called the quadra%c scoring rule p S(p,!) =a! b e! p 2!- th indicator vector Parameters, b >0. Affine transforma%on does not change incen%ves.
6 Other Strictly Proper Scoring Rules Logarithmic scoring rule S(p,!) = log p! Spherical scoring rule S(p,!)= p! p
7 Proper Scoring Rules Scoring rule S(p,!) Expected score for predic%on given belief q : predic%on belief S(p, q) := nx!=1 p q! S(p,!) A scoring rule S(p,!) is proper if and only if S(q, q) S(p, q). It is strictly proper if the inequality is strict unless q = p. Proper scoring rules are dominant- strategy incen%ve compa%ble for risk- neutral agents.
8 Geometric Interpreta%on Brier Scoring Rule S(p, sunny) = 1 (1 p) 2 G(p) =S(p, p) =(p 1/2) 2 +3/4 S(p, rainy) = 1 p Bregman Divergence D G (q, p) =G(q) G(p) rg(p)(q p) G G(q) =S(q, q) 0.85 S(p, sunny) G(p) =S(p, p) S(p, q) 0.7 S(p, rainy) 0.65 q p Probability for Sunny
9 McCarthy, Savage Characteriza%on [McCarthy 1956][Savage 1971] A scoring rule S(p,!) S(p,!)=G(p) is (strictly) proper if and only if rg(p) p + rg! (p) where G is a (strictly) convex func%on and rg(p) is a subgradient of G and rg! (p) is its!-th component., Expected score S(p, p) = X! p! (G(p) rg(p) p + rg! (p)) = G(p) In terms of Bregman Divergence, for differen%able G, S(p,!) =G(p) rg(p) p + rg(p) e! = G(e! ) (G(e! ) G(p) rg(p) (e! p)) = G(e! ) D G (e!, p)
10 Common Strictly Proper Scoring Rules Brier scoring rule S(p,!) =1 e! p 2 G(p) = p 2 D G (q, p) = q p 2 Logarithmic scoring rule S(p,!) = log p! G(p) = X! p! log p! D G (q, p) = X! q! log q! p! Spherical scoring rule G(p) = p S(p,!)= p! p D G (q, p) = q q p p
11 Other Work on Scoring Rules Proper scoring rules for con%nuous variables [Matheson and Winkler 1976; Gnei%ng and RaTery 2007] Proper scoring rules for proper%es of distribu%ons (e.g. mean, quin%les) [Savage 1971; Lambert et al. 2008; Abernethy and Frongillo 2012] Scoring rules for more complex environments Agents can affect the event outcome [Shi et al. 2009; Bacon et al. 2012] A decision will be made based on the elicited informa%on [Othman and Sandholm. 2010; Chen and Kash 2011; Bou%lier 2012]
12 One Expert à Mul%ple Experts
13 Market Scoring Rules (MSR) [Hanson 2003, 2007] Sequen%al, shared version of proper scoring rules Reward improvements on predic%on Select a proper scoring rule S(p,!) Market opens with an ini%al predic%on Par%cipants sequen%ally change the market predic%on Par%cipant who changes the predic%on from p t 1 to p t receives payment S(p t,!) S(p t 1,!) p 0
14 An Example: LMSR Market S(p,!) = 5 log p! t 5log(0.9)- 5log(0.5) 5log(0.6)- 5log(0.5) 5log(0.8)- 5log(0.6) 5log(0.4)- 5log(0.8) 5log(0.9)- 5log(0.4) 5log(0.1)- 5log(0.5) 5log(0.4)- 5log(0.5) 5log(0.2)- 5log(0.4) 5log(0.6)- 5log(0.2) 5log(0.1)- 5log(0.6) The mechanism only pays the final par%cipant!
15 Proper%es of MSR Bounded loss (subsidy) Eg. Loss bound of LMSR with S(p,!) =b log p! is b log n Incen%ve compa%ble for myopic par%cipants Recent work studies informa%on aggrega%on in MSR with forward- looking par%cipants [Chen et al. 2010; Ostrovsky 2012; Gao et al. 2013] Market as a Bayesian extensive- form game Condi%ons under which informa%on is fully aggregated in the market
16 Predic%on and Trading p 1 p $1 iff Buy this contract if Sell this contract if price <p price >p
17 MSR as Automated Market Makers [Chen and Pennock 07] One contract for each outcome Payments are determined by a cost poten%al func%on C(Q) Q i is the current number of shares of the contract for outcome! that have been purchased Current cost of purchasing a bundle R of shares is C(Q + R) Instantaneous prices $1 iff! C(Q) p! Market Predic%on
18 Example LMSR with S(p,!) =b log p! Cost func%on C(Q) =b log X! e Q!/b Price func%ons p! (Q) = log e Q!/b P! 0 e Q! 0 /b
19 LMSR Equivalence C(Q) = log X! e Q! Profit of a par%cipant who changes to in state Q Q! ( Q! Q! ) (C( Q) C(Q)) =( Q! C( Q)) (Q! C(Q)) p! (Q) = = (log e Q! log X! 0 e Q!0 ) (log e Q! log X! 0 e Q! 0 ) e Q! P! 0 e Q! 0 S(p,!) = log p! e Q! e Q! = log P! e Q log P 0! 0! e Q 0! 0 = log p! ( Q) log p! (Q) = S(p( Q),!) S(p(Q),!)
20 Cost Func%on MM [Abernethy et al. 2013] Strictly Proper MSR An MSR using a strictly proper scoring rule The expected scoring func%on The corresponding cost func%on MM G(p) =S(p, p) S(p,!) C(Q) = sup p2 n Q p G(p) Conjugate Duality p(q) =rg(q) = arg max p2 n Q p G(p) p(q) Profit equivalence holds when interior of the probability simplex is in the rela%ve
21 Elici%ng Unverifiable Informa%on
22 Unverifiable Informa%on Is this website age- appropriate for children? Yes No
23 The General Sesng State E.g. whether this website is really age- appropriate or not m 2 agents i E.g. whether agent i Each agent! 2 {1, 2,...,n} receives a private signal s i 2 S thinks the website age- appropriate Prior distribu%on Pr(!,s 1,...,s m ) is common knowledge for all agents Goal: truthfully revealing their private signal strict Bayesian Nash equilibrium s i is a
24 The Peer Predic%on Mechanism [Miller et al. 2005] Require that the mechanism knows the prior Each agent has a reference agent Payment S(Pr(s j ŝ i ), ŝ j ) s i ŝ i Mechanism Pr(s j ŝ i ) s j ŝ j Pr(s 1,...,s m ) Pr(s i ŝ j ) Payment S(Pr(s i ŝ j ), ŝ i )
25 The Peer Predic%on Mechanism [Miller et al. 2005] S(p, ŝ) is a strictly proper scoring rule Technical assump%on: Stochas%c Relevance Pr(s j s i ) 6= Pr(s j s 0 i), 8s i 6= s 0 i Truthful repor%ng is a strict Bayesian Nash equilibrium. Payment S(Pr(s j ŝ i ), ŝ j ) Requiring the mechanism know the prior is undesirable! s i s j ŝ i ŝ j Mechanism Pr(s 1,...,s m ) Pr(s j ŝ i ) Pr(s i ŝ j ) Payment S(Pr(s i ŝ j ), ŝ i )
26 Bayesian Truth Serum (BTS) [Prelec 2004] Is this website age- appropriate for children? (Yes, No) Each agent is asked for two reports The mechanism calculates Score for agent i: x i Informa%on report: is an indicator vector, having value 1 at its k-th element if agent i reports signal k Predic%on report: y i is agent i s predic%on of the frequency of reported signals in the popula%on x k = lim n!1 1 n nx i=1 X k x i k x i k log x k ȳ k + X k log ȳ k = lim n!1 x k log yi k x k 1 n nx log y i k i=1
27 Bayesian Truth Serum (BTS) Technical assump%ons: condi%onal independence of signals and stochas%c relevance When n!1, truthful repor%ng is a strict Bayesian Nash equilibrium. For sufficiently large n, truthful repor%ng is a strict Bayesian Nash equilibrium. But depends on the prior. Informa%on Score X k x i k log x k ȳ k + X k x k log yi k x k Predic%on Score Log scoring rule! Truthful predic%on reports
28 BTS: Surprisingly Common True signal maximizes X Consider an agent with yes signal k x i k log x k ȳ k in expecta%on Predic%on for "Yes" Predic%on for "No" 0 Prior Agents with "Yes" Agents with "No" Geometric mean
29 Robust Bayesian Truth Serum (RBTS) [Witkowski and Parkes 2012a] Works for small popula%ons RBTS assumes binary signals Each agent S = {0, 1} is asked for two reports i Informa%on report: reported signal x i 2 {0, 1} Predic%on report: y i 2 [0, 1] is the predic%on of the frequency of signal 1 Each agent has two reference agents
30 Robust Bayesian Truth Serum (RBTS) [Witkowski and Parkes 2012a] s i s j S(y 0 i, x k )+S(y i, x k ), S being the Brier scoring rule (x i,y i ) Mechanism (x j,y j ) y 0 { y j + d if x i =1 i = yj d if x i =0 s k (x k,y k ) d =min{y j, 1 y j } Truthful repor%ng is a strict Bayesian Nash equilibrium for n 3.
31 Shadowing S is the Brier scoring rule Informa%on Score S(y 0 i, x k )+S(y i, x k ) Predic%on Score y 0 { y j + d if x i =1 i = yj d if x i =0 Shadowing d =min{y j, 1 y j } 0 y 1 j x d d x Predic%on of agent i given signal 0 and y j Predic%on of agent i given signal 1 and y j
32 Other Related Work Many improvements on the original peer predic%on [Jurca and Fal%ngs 2006, 2007, 2008, 2011] Private prior peer predic%on [Witkowski and Parkes 2012b] RBTS for non- binary signals [Radanovic and Fal%ngs, 2013]
33 Ques%ons? hwp://yiling.seas.harvard.edu
34 References J. Abernethy, Y. Chen, and J. W. Vaughan, Efficient Market Making via Convex Op%miza%on, and a Connec%on to Online Learning. ACM Transac%ons on Economics and Computa%on. Vol. 1, no. 2, pp. 12:1-12:39. J. D. Abernethy and R. M. Frongillo A Characteriza%on of Scoring Rules for Linear Proper%es. COLT 12. D. F. Bacon, Y. Chen, I. A. Kash, D. C. Parkes, M. Rao, and M. Sridharan Predic%ng Your Own Effort. AAMAS 12. C. Bou%lier Elici%ng forecasts from self- interested experts: scoring rules for decision makers. AAMAS 12. G. W. Brier Verifica%on of forecasts expressed in terms of probability. Monthly Weather Review 78(1): 1-3. Y. Chen, S. Dimitrov, R. Sami, D. M. Reeves, D. M. Pennock, R. D. Hanson, L. Fortnow, and R. Gonen Gaming predic%on markets: equilibrium strategies with a market maker. Algorithmica, 58: Y. Chen and D. M. Pennock, A U%lity Framework for Bounded- Loss Market Makers. UAI'07. Y. Chen and I. A. Kash Informa%on elicita%on for decision making. AAMAS 11.
35 References (Cont.) X. A. Gao, J. Zhang, Y. Chen What You Jointly Know Determines How You Act - Strategic Interac%ons in Predic%on Markets, EC 13. T. Gnei%ng and A. E. RaTery Strictly proper scoring rules, predic%on, and es%ma%on. Journal of the American Sta%s%cal Associa%on 102, 477, R. D. Hanson Combinatorial informa%on market design. Informa%on Systems Fron%ers 5(1), R. D. Hanson Logarithmic market scoring rules for modular combinatorial informa%on aggrega%on. Journal of Predic%on Markets, 1(1), R. Jurca and B. Fal%ngs, Minimum Payments that Reward Honest Reputa%on Feedback. EC'06. R. Jurca and B. Fal%ngs, Collusion Resistant, Incen%ve Compa%ble Feedback Payments. EC'07. R. Jurca and B. Fal%ngs.Incen%ves For Expressing Opinions in Online Polls, EC'08. R. Jurca and B. Fal%ngs Incen%ves for Answering Hypothe%cal Ques%ons. Workshop on Social Compu%ng and User Generated Content at EC'11. N. S. Lambert, D. M. Pennock, and Y. Shoham Elici%ng proper%es of probability distribu%ons. EC '08. J. E. Matheson and R. L. Winkler Scoring rules for con%nuous probability distribu%ons. Management Science 22,
36 References (Cont.) J. McCarthy Measures of the value of informa%on. PNAS: Proceedings of the Na%onal Academy of Sciences of the United States of America, 42(9): N. Miller, P. Resnick, and R. Zeckhauser 2005, Management Science, 51(9): A. Othman and T. Sandholm Decision rules and decision markets. AAMAS 10. M. Ostrovsky Informa%on aggrega%on in dynamic markets with strategic traders. Econometrica, 80(6): D. Prelec, A Bayesian Truth Serum for Subjec%ve Data. Science, 306 (5695): G. Radanovic and B. Fal%ngs, A Robust Bayesian Truth Serum for Non- Binary Signals. AAAI 13. L. J. Savage Elicita%on of personal probabili%es and expecta%ons. Journal of the American Sta%s%cal Associa%on, 66(336): P. Shi, V. Conitzer, and M. Guo Predic%on mechanisms that do not incen%vize undesirable ac%ons. WINE 09. J. Witkowski and D. C. Parkes, 2012a. A Robust Bayesian Truth Serum for Small Popula%ons. AAAI'12. J. Witkowski and D. C. Parkes, 2012b. Peer Predic%on without a Common Prior. EC'12.
Informa(onal Subs(tutes and Complements for Predic(on
Informa(onal Subs(tutes and Complements for Predic(on Yiling Chen Harvard University November 19, 2015 Joint work with Bo Waggoner Roadmap Informa(on, predic(on and predic(on markets Subs(tutes and complements
More informationElicitation and Machine Learning. Part I
Elicitation and Machine Learning a tutorial at EC 2016 Part I Rafael Frongillo and Bo Waggoner 25 July 2016 Information Elicitation Contracts to exchange information for money/goods. Scoring rules, peer
More informationA Robust Bayesian Truth Serum for Small Populations
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence A Robust Bayesian Truth Serum for Small Populations Jens Witkowski Department of Computer Science Albert-Ludwigs-Universität Freiburg,
More informationPredicting Own Action: Self-Fulfilling Prophecy Induced by Proper Scoring Rules
Proceedings of the Second AAAI Conference on Human Computation and Crowdsourcing (HCOMP 2014) Predicting Own Action: Self-Fulfilling Prophecy Induced by Proper Scoring Rules Masaaki Oka 1, Taiki Todo 1,
More informationPrediction Mechanisms That Do Not Incentivize Undesirable Actions
Prediction Mechanisms That Do Not Incentivize Undesirable Actions Peng Shi, Vincent Conitzer, and Mingyu Guo Department of Computer Science, Duke University, Durham, NC 27708, USA ps46@duke.edu,{conitzer,mingyu}@cs.duke.edu
More informationInformational Substitutes and Complements. Bo Waggoner June 18, 2018 University of Pennsylvania
Informational Substitutes and Complements Bo Waggoner June 18, 2018 University of Pennsylvania 1 Background Substitutes: the total is less valuable than the sum of individual values each s value decreases
More informationPrediction Mechanisms That Do Not Incentivize Undesirable Actions
Prediction Mechanisms That Do Not Incentivize Undesirable Actions Peng Shi, Vincent Conitzer, and Mingyu Guo Department of Computer Science, Duke University, Durham, NC 27708, USA ps46@duke.edu,{conitzer,mingyu}@cs.duke.edu
More informationElicitation for Aggregation
Elicitation for Aggregation Rafael M. Frongillo Harvard University raf@cs.berkeley.edu Yiling Chen Harvard University yiling@seas.harvard.edu Ian A. Kash Microsoft Research iankash@microsoft.com Abstract
More informationDwelling on the Negative: Incentivizing Effort in Peer Prediction
Dwelling on the Negative: Incentivizing Effort in Peer Prediction Jens Witkowski Albert-Ludwigs-Universität Freiburg, Germany witkowsk@informatik.uni-freiburg.de Yoram Bachrach Microsoft Research Cambridge,
More informationarxiv: v1 [cs.gt] 23 Mar 2016
Putting Peer Prediction Under the Micro(economic)scope and Making Truth-telling Focal arxiv:1603.07319v1 [cs.gt] 23 Mar 2016 Yuqing Kong University of Michigan Grant Schoenebeck University of Michigan
More informationA Eliciting Predictions for Discrete Decision Making
A Eliciting Predictions for Discrete Decision Making YILING CHEN, Harvard University IAN A. KASH, Microsoft Research MIKE RUBERRY, Harvard University VICTOR SHNAYDER, Harvard University We consider a decision
More informationPartial Truthfulness in Minimal Peer Prediction Mechanisms with Limited Knowledge
Partial Truthfulness in Minimal Peer Prediction Mechanisms with Limited Knowledge Goran Radanovic Harvard University Cambridge, USA gradanovic@g.harvard.edu Boi Faltings EPFL Lausanne, Switzerland boi.faltings@epfl.ch
More informationPeer Prediction without a Common Prior
Peer Prediction without a Common Prior JENS WITKOWSKI, Albert-Ludwigs-Universität Freiburg DAVID C. PARKES, Harvard University Reputation mechanisms at online opinion forums, such as Amazon Reviews, elicit
More informationPartial Truthfulness in Minimal Peer Prediction Mechanisms with Limited Knowledge
Partial Truthfulness in Minimal Peer Prediction Mechanisms with Limited Knowledge Goran Radanovic Harvard University Cambridge, USA gradanovic@g.harvard.edu Boi Faltings EPFL Lausanne, Switzerland boi.faltings@epfl.ch
More informationarxiv: v1 [cs.gt] 7 Oct 2015
Budget Constraints in Prediction Markets Nikhil Devanur Microsoft Research Miroslav Dudík Microsoft Research Zhiyi Huang University of Hong Kong David M. Pennock Microsoft Research arxiv:1510.02045v1 [cs.gt]
More informationInformational Substitutes
Informational Substitutes Yiling Chen Bo Waggoner Harvard UPenn 0. Information Information (in this talk) Random variables X, Y 1,, Y n jointly distributed, known prior. (finite set of outcomes) We care
More informationSequential Peer Prediction: Learning to Elicit Effort using Posted Prices
Sequential Peer Prediction: Learning to Elicit Effort using Posted Prices Yang Liu and Yiling Chen Harvard University, Cambridge MA, USA {yangl,yiling}@seas.harvard.edu Abstract Peer prediction mechanisms
More informationarxiv: v1 [cs.gt] 13 Jun 2011
Eliciting Forecasts from Self-interested Experts: Scoring Rules for Decision Makers Craig Boutilier Department of Computer Science University of Toronto, Canada cebly@cs.toronto.edu arxiv:1106.2489v1 [cs.gt]
More informationEliciting High Quality Feedback from Crowdsourced Tree Networks using Continuous Scoring Rules
Eliciting High Quality Feedback from Crowdsourced Tree Networks using Continuous Scoring Rules Ratul Ray, Rohith D. Vallam, and Y. Narahari Department of Computer Science and Automation, Indian Institute
More informationCoherence with Proper Scoring Rules
Coherence with Proper Scoring Rules Mark Schervish, Teddy Seidenfeld, and Joseph (Jay) Kadane Mark Schervish Joseph ( Jay ) Kadane Coherence with Proper Scoring Rules ILC, Sun Yat-Sen University June 2010
More informationCS 6140: Machine Learning Spring What We Learned Last Week 2/26/16
Logis@cs CS 6140: Machine Learning Spring 2016 Instructor: Lu Wang College of Computer and Informa@on Science Northeastern University Webpage: www.ccs.neu.edu/home/luwang Email: luwang@ccs.neu.edu Sign
More informationA Collaborative Mechanism for Crowdsourcing Prediction Problems
A Collaborative Mechanism for Crowdsourcing Prediction Problems Jacob Abernethy Division of Computer Science University of California at Berkeley jake@cs.berkeley.edu Rafael M. Frongillo Division of Computer
More informationBounded Rationality in Wagering Mechanisms
Bounded Rationality in Wagering Mechanisms David M. Pennock Microsoft Research 64 Avenue of the Americas New York, NY 00 Vasilis Syrgkanis Microsoft Research 64 Avenue of the Americas New York, NY 00 Jennifer
More informationElicitation and Evaluation of Statistical Forecasts
Elicitation and Evaluation of Statistical Forecasts Nicolas S. Lambert March 13, 2018 Abstract An expert has probabilistic information about a random state. The expert is asked to make a prediction regarding
More informationCS 6140: Machine Learning Spring What We Learned Last Week. Survey 2/26/16. VS. Model
Logis@cs CS 6140: Machine Learning Spring 2016 Instructor: Lu Wang College of Computer and Informa@on Science Northeastern University Webpage: www.ccs.neu.edu/home/luwang Email: luwang@ccs.neu.edu Assignment
More informationCS 6140: Machine Learning Spring 2016
CS 6140: Machine Learning Spring 2016 Instructor: Lu Wang College of Computer and Informa?on Science Northeastern University Webpage: www.ccs.neu.edu/home/luwang Email: luwang@ccs.neu.edu Logis?cs Assignment
More informationGame Theory for Data Science: Eliciting High-Quality Information
Game Theory for Data Science: Eliciting High-Quality Information Boi Faltings 1 Goran Radanovic 2 1 AI Laboratory, EPFL boi.faltings@epfl.ch 2 EconCS, Harvard gradanovic@seas.harvard.edu December 11th,
More informationA Collaborative Mechanism for Crowdsourcing Prediction Problems
A Collaborative Mechanism for Crowdsourcing Prediction Problems Jacob Abernethy Division of Computer Science University of California at Berkeley jake@cs.berkeley.edu Rafael M. Frongillo Division of Computer
More informationScoring rules can provide incentives for truthful reporting of probabilities and evaluation measures for the
MANAGEMENT SCIENCE Vol. 55, No. 4, April 2009, pp. 582 590 issn 0025-1909 eissn 1526-5501 09 5504 0582 informs doi 10.1287/mnsc.1080.0955 2009 INFORMS Sensitivity to Distance and Baseline Distributions
More informationAggrega?on of Epistemic Uncertainty
Aggrega?on of Epistemic Uncertainty - Certainty Factors and Possibility Theory - Koichi Yamada Nagaoka Univ. of Tech. 1 What is Epistemic Uncertainty? Epistemic Uncertainty Aleatoric Uncertainty (Sta?s?cal
More informationThree contrasts between two senses of coherence
Three contrasts between two senses of coherence Teddy Seidenfeld Joint work with M.J.Schervish and J.B.Kadane Statistics, CMU Call an agent s choices coherent when they respect simple dominance relative
More informationInformation Aggregation in Dynamic Markets Under Ambiguity
Information Aggregation in Dynamic Markets Under Ambiguity Spyros Galanis University of Southampton Stelios Kotronis University of Southampton May 30, 2018 Abstract This paper studies information aggregation
More informationRedistribution Mechanisms for Assignment of Heterogeneous Objects
Redistribution Mechanisms for Assignment of Heterogeneous Objects Sujit Gujar Dept of Computer Science and Automation Indian Institute of Science Bangalore, India sujit@csa.iisc.ernet.in Y Narahari Dept
More informationMaximizing Revenue with Limited Correlation: The Cost of Ex-Post Incentive Compatibility
Michael Albert Department of Computer Science University of Texas at Austin 237 Speedway, Stop D9500 Austin, TX 7872, USA malbert@cs.utexas.edu Maximizing Revenue with Limited Correlation: The Cost of
More informationProbability Elicitation for Agents with Arbitrary Risk Preferences
Probability Elicitation for Agents with Arbitrary Risk Preferences Nicolas S. Lambert July 2018 Abstract A principal asks an agent for his probability assessment of a random event, and wants to induce
More informationMaximizing Revenue with Limited Correlation: The Cost of Ex-Post Incentive Compatibility
Maximizing Revenue with Limited Correlation: The Cost of Ex-Post Incentive Compatibility Michael Albert Department of Computer Science University of Texas at Austin 237 Speedway, Stop D9500 Austin, TX
More informationSequential Bidding in the Bailey-Cavallo Mechanism
Sequential Bidding in the Bailey-Cavallo Mechanism Krzysztof R. Apt 1,2 and Evangelos Markakis 2 1 CWI, Science Park 123, 1098 XG Amsterdam 2 Institute of Logic, Language and Computation, University of
More informationMicroeconomic Theory (501b) Problem Set 10. Auctions and Moral Hazard Suggested Solution: Tibor Heumann
Dirk Bergemann Department of Economics Yale University Microeconomic Theory (50b) Problem Set 0. Auctions and Moral Hazard Suggested Solution: Tibor Heumann 4/5/4 This problem set is due on Tuesday, 4//4..
More informationA Decomposition of Forecast Error in Prediction Markets
A Decomposition of Forecast Error in Prediction Markets Miroslav Dudík Microsoft Research, New York, NY mdudik@microsoft.com Sébastien Lahaie Google, New York, NY slahaie@google.com arxiv:1702.07810v2
More informationLinear Regression and Correla/on. Correla/on and Regression Analysis. Three Ques/ons 9/14/14. Chapter 13. Dr. Richard Jerz
Linear Regression and Correla/on Chapter 13 Dr. Richard Jerz 1 Correla/on and Regression Analysis Correla/on Analysis is the study of the rela/onship between variables. It is also defined as group of techniques
More informationLinear Regression and Correla/on
Linear Regression and Correla/on Chapter 13 Dr. Richard Jerz 1 Correla/on and Regression Analysis Correla/on Analysis is the study of the rela/onship between variables. It is also defined as group of techniques
More informationTheory of Auctions. Carlos Hurtado. Jun 23th, Department of Economics University of Illinois at Urbana-Champaign
Theory of Auctions Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 23th, 2015 C. Hurtado (UIUC - Economics) Game Theory On the Agenda 1 Formalizing
More informationNoncooperative Games, Couplings Constraints, and Partial Effi ciency
Noncooperative Games, Couplings Constraints, and Partial Effi ciency Sjur Didrik Flåm University of Bergen, Norway Background Customary Nash equilibrium has no coupling constraints. Here: coupling constraints
More informationarxiv: v1 [cs.gt] 2 Oct 2013
Designing Markets for Daily Deals arxiv:1310.0548v1 [cs.gt] 2 Oct 2013 Yang Cai, Mohammad Mahdian, Aranyak Mehta, and Bo Waggoner July 31, 2018 Abstract Daily deals platforms such as Amazon Local, Google
More informationVirtual Robust Implementation and Strategic Revealed Preference
and Strategic Revealed Preference Workshop of Mathematical Economics Celebrating the 60th birthday of Aloisio Araujo IMPA Rio de Janeiro December 2006 Denitions "implementation": requires ALL equilibria
More informationarxiv: v2 [cs.gt] 17 Jan 2018
An Information Theoretic Framework For Designing Information Elicitation Mechanisms That Reward Truth-telling arxiv:1605.01021v2 [cs.gt] 17 Jan 2018 Yuqing Kong University of Michigan Abstract Grant Schoenebeck
More informationMicroeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016
Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016 1 Modelling incomplete information So far, we have studied games in which information was complete,
More informationThe Social Value of Credible Public Information
The Social Value of Credible Public Information Ercan Karadas NYU September, 2017 Introduction Model Analysis MOTIVATION This paper is motivated by the paper Social Value of Public Information, Morris
More informationCSCI 360 Introduc/on to Ar/ficial Intelligence Week 2: Problem Solving and Op/miza/on. Professor Wei-Min Shen Week 8.1 and 8.2
CSCI 360 Introduc/on to Ar/ficial Intelligence Week 2: Problem Solving and Op/miza/on Professor Wei-Min Shen Week 8.1 and 8.2 Status Check Projects Project 2 Midterm is coming, please do your homework!
More informationCSE 473: Ar+ficial Intelligence. Hidden Markov Models. Bayes Nets. Two random variable at each +me step Hidden state, X i Observa+on, E i
CSE 473: Ar+ficial Intelligence Bayes Nets Daniel Weld [Most slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at hnp://ai.berkeley.edu.]
More informationLearning Equilibrium as a Generalization of Learning to Optimize
Learning Equilibrium as a Generalization of Learning to Optimize Dov Monderer and Moshe Tennenholtz Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Haifa 32000,
More informationKNMI Climate Explorer A tool for climate analysis [ and seasonal prediction]
KNMI Climate Explorer A tool for climate analysis [ and seasonal prediction] MedCOF Training Workshop Madrid, 26-30 October 2015 Jonathan Eden Royal Netherlands Meteorological Institute (KNMI) An introduc+on
More informationGene Regulatory Networks II Computa.onal Genomics Seyoung Kim
Gene Regulatory Networks II 02-710 Computa.onal Genomics Seyoung Kim Goal: Discover Structure and Func;on of Complex systems in the Cell Identify the different regulators and their target genes that are
More informationRobust Mechanism Design with Correlated Distributions. Michael Albert and Vincent Conitzer and
Robust Mechanism Design with Correlated Distributions Michael Albert and Vincent Conitzer malbert@cs.duke.edu and conitzer@cs.duke.edu Prior-Dependent Mechanisms In many situations we ve seen, optimal
More informationA CHARACTERIZATION FOR THE SPHERICAL SCORING RULE
Theory and Decision (2009) 66:263 281 Springer 2007 DOI 10.1007/s11238-007-9067-x VICTOR RICHMOND JOSE A CHARACTERIZATION FOR THE SPHERICAL SCORING RULE ABSTRACT. Strictly proper scoring rules have been
More informationBellman s Curse of Dimensionality
Bellman s Curse of Dimensionality n- dimensional state space Number of states grows exponen
More informationTsybakov noise adap/ve margin- based ac/ve learning
Tsybakov noise adap/ve margin- based ac/ve learning Aar$ Singh A. Nico Habermann Associate Professor NIPS workshop on Learning Faster from Easy Data II Dec 11, 2015 Passive Learning Ac/ve Learning (X j,?)
More informationWireless Network Pricing Chapter 6: Oligopoly Pricing
Wireless Network Pricing Chapter 6: Oligopoly Pricing Jianwei Huang & Lin Gao Network Communications and Economics Lab (NCEL) Information Engineering Department The Chinese University of Hong Kong Huang
More informationPSAAP Project Stanford
PSAAP Project QMU @ Stanford Component Analysis and rela:on to Full System Simula:ons 1 What do we want to predict? Objec:ve: predic:on of the unstart limit expressed as probability of unstart (or alterna:vely
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Myerson Optimal Auction Note: This is a only a draft version,
More informationDeceptive Advertising with Rational Buyers
Deceptive Advertising with Rational Buyers September 6, 016 ONLINE APPENDIX In this Appendix we present in full additional results and extensions which are only mentioned in the paper. In the exposition
More informationPreliminary Results on Social Learning with Partial Observations
Preliminary Results on Social Learning with Partial Observations Ilan Lobel, Daron Acemoglu, Munther Dahleh and Asuman Ozdaglar ABSTRACT We study a model of social learning with partial observations from
More informationContent Pricing in Peer-to-Peer Networks
Content Pricing in Peer-to-Peer Networks Jaeok Park and Mihaela van der Schaar Electrical Engineering Department, UCLA 21 Workshop on the Economics of Networks, Systems, and Computation (NetEcon 1) October
More informationAlgorithmic Game Theory and Applications
Algorithmic Game Theory and Applications Lecture 18: Auctions and Mechanism Design II: a little social choice theory, the VCG Mechanism, and Market Equilibria Kousha Etessami Reminder: Food for Thought:
More informationPrediction Markets: Theory and Applications
Prediction Markets: Theory and Applications A dissertation presented by Michael Edward Ruberry to The School of Engineering and Applied Sciences in partial fulfillment of the requirements for the degree
More information5. Externalities and Public Goods. Externalities. Public Goods types. Public Goods
5. Externalities and Public Goods 5. Externalities and Public Goods Externalities Welfare properties of Walrasian Equilibria rely on the hidden assumption of private goods: the consumption of the good
More informationBayesian networks Lecture 18. David Sontag New York University
Bayesian networks Lecture 18 David Sontag New York University Outline for today Modeling sequen&al data (e.g., =me series, speech processing) using hidden Markov models (HMMs) Bayesian networks Independence
More informationMachine-Learning Aided Peer Prediction
Machine-Learning Aided Peer Prediction YANG LIU, Harvard University YILING CHEN, Harvard University Information Elicitation without Verication (IEWV) is a classic problem where a principal wants to truthfully
More informationLecture 4. 1 Examples of Mechanism Design Problems
CSCI699: Topics in Learning and Game Theory Lecture 4 Lecturer: Shaddin Dughmi Scribes: Haifeng Xu,Reem Alfayez 1 Examples of Mechanism Design Problems Example 1: Single Item Auctions. There is a single
More informationAre We There Yet? Mechanism Design Beyond Equilibrium
Are We There Yet? Mechanism Design Beyond Equilibrium Matthew Van Essen* Department of Economics, Finance, and Legal Studies University of Alabama Mark Walker Department of Economics University of Arizona
More informationIntroduction to Particle Filters for Data Assimilation
Introduction to Particle Filters for Data Assimilation Mike Dowd Dept of Mathematics & Statistics (and Dept of Oceanography Dalhousie University, Halifax, Canada STATMOS Summer School in Data Assimila5on,
More informationTrade policy III: Export subsidies
The Vienna Institute for International Economic Studies - wiiw June 25, 2015 Overview Overview 1 1 Under perfect competition lead to welfare loss 2 Effects depending on market structures 1 Subsidies to
More information5. Externalities and Public Goods
5. Externalities and Public Goods Welfare properties of Walrasian Equilibria rely on the hidden assumption of private goods: the consumption of the good by one person has no effect on other people s utility,
More informationMechanism Design. Christoph Schottmüller / 27
Mechanism Design Christoph Schottmüller 2015-02-25 1 / 27 Outline 1 Bayesian implementation and revelation principle 2 Expected externality mechanism 3 Review questions and exercises 2 / 27 Bayesian implementation
More informationA Review of Auction Theory: Sequential Auctions and Vickrey Auctions
A Review of Auction Theory: and Vickrey Daniel R. 1 1 Department of Economics University of Maryland, College Park. September 2017 / Econ415 . Vickrey s. Vickrey. Example Two goods, one per bidder Suppose
More informationA Game-Theoretic Analysis of Games with a Purpose
A Game-Theoretic Analysis of Games with a Purpose The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Published Version
More informationGame Theory. Monika Köppl-Turyna. Winter 2017/2018. Institute for Analytical Economics Vienna University of Economics and Business
Monika Köppl-Turyna Institute for Analytical Economics Vienna University of Economics and Business Winter 2017/2018 Static Games of Incomplete Information Introduction So far we assumed that payoff functions
More informationCPS 173 Mechanism design. Vincent Conitzer
CPS 173 Mechanism design Vincent Conitzer conitzer@cs.duke.edu edu Mechanism design: setting The center has a set of outcomes O that she can choose from Allocations of tasks/resources, joint plans, Each
More informationGame Theory Fall 2003
Game Theory Fall 2003 Problem Set 1 [1] In this problem (see FT Ex. 1.1) you are asked to play with arbitrary 2 2 games just to get used to the idea of equilibrium computation. Specifically, consider the
More informationAn Axiomatic Characterization of Wagering Mechanisms
An Axiomatic Characterization of Wagering Mechanisms Nicolas S. Lambert John Langford Jennifer Wortman Vaughan Yiling Chen Daniel Reeves Yoav Shoham David M. Pennock December 2011 Abstract We construct
More informationPRICING COMBINATORIAL MARKETS FOR TOURNAMENTS. Yahoo! Research 111 West 40th Street, 17th Floor New York, NY 10018
PRICING COMBINATORIAL MARKETS FOR TOURNAMENTS YILING CHEN, SHARAD GOEL AND DAVID PENNOCK Yahoo! Research 111 West 40th Street, 17th Floor New York, NY 10018 Email: {cheny, goel, pennockd}@yahoo-inc.com
More informationComputer Vision. Pa0ern Recogni4on Concepts Part I. Luis F. Teixeira MAP- i 2012/13
Computer Vision Pa0ern Recogni4on Concepts Part I Luis F. Teixeira MAP- i 2012/13 What is it? Pa0ern Recogni4on Many defini4ons in the literature The assignment of a physical object or event to one of
More informationConvex Foundations for Generalized MaxEnt Models
Convex Foundations for Generalized MaxEnt Models Rafael Frongillo and Mark D. Reid Microsoft Research, New York City, NY, United States The Australian National University & NICTA, Canberra, ACT, Australia
More informationBasics of Game Theory
Basics of Game Theory Giacomo Bacci and Luca Sanguinetti Department of Information Engineering University of Pisa, Pisa, Italy {giacomo.bacci,luca.sanguinetti}@iet.unipi.it April - May, 2010 G. Bacci and
More informationMolecular Programming Models. Based on notes by Dave Doty
Molecular Programming Models Based on notes by Dave Doty Outline Stable predicate decidability Stably computable predicates == semilinear predicates (and stably computable func
More informationCompetitive Equilibrium
Competitive Equilibrium Econ 2100 Fall 2017 Lecture 16, October 26 Outline 1 Pareto Effi ciency 2 The Core 3 Planner s Problem(s) 4 Competitive (Walrasian) Equilibrium Decentralized vs. Centralized Economic
More informationVickrey Auction VCG Characterization. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design
Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Characterization of IC Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer
More informationPeer Prediction with Heterogeneous Users
Peer Prediction with Heterogeneous Users ARPIT AGARWAL, University of Pennsylvania DEBMALYA MANDAL, Harvard University DAVID C. PARKES, Harvard University NISARG SHAH, Harvard University Peer prediction
More informationA Contract for Demand Response based on Probability of Call
A Contract for Demand Response based on Probability of Call Jose Vuelvas, Fredy Ruiz and Giambattista Gruosso Pontificia Universidad Javeriana - Politecnico di Milano 2018 1 2 Outline Introduction Problem
More informationBayes Correlated Equilibrium and Comparing Information Structures
Bayes Correlated Equilibrium and Comparing Information Structures Dirk Bergemann and Stephen Morris Spring 2013: 521 B Introduction game theoretic predictions are very sensitive to "information structure"
More informationComputing Minmax; Dominance
Computing Minmax; Dominance CPSC 532A Lecture 5 Computing Minmax; Dominance CPSC 532A Lecture 5, Slide 1 Lecture Overview 1 Recap 2 Linear Programming 3 Computational Problems Involving Maxmin 4 Domination
More informationGraphical Models. Lecture 3: Local Condi6onal Probability Distribu6ons. Andrew McCallum
Graphical Models Lecture 3: Local Condi6onal Probability Distribu6ons Andrew McCallum mccallum@cs.umass.edu Thanks to Noah Smith and Carlos Guestrin for some slide materials. 1 Condi6onal Probability Distribu6ons
More information"Arrow s Theorem and the Gibbard-Satterthwaite Theorem: A Unified Approach", by Phillip Reny. Economic Letters (70) (2001),
February 25, 2015 "Arrow s Theorem and the Gibbard-Satterthwaite Theorem: A Unified Approach", by Phillip Reny. Economic Letters (70) (2001), 99-105. Also recommended: M. A. Satterthwaite, "Strategy-Proof
More informationApproximately Revenue-Maximizing Auctions for Deliberative Agents
Approximately Revenue-Maximizing Auctions for Deliberative Agents L. Elisa Celis ecelis@cs.washington.edu University of Washington Anna R. Karlin karlin@cs.washington.edu University of Washington Kevin
More informationCSE 473: Ar+ficial Intelligence
CSE 473: Ar+ficial Intelligence Hidden Markov Models Luke Ze@lemoyer - University of Washington [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188
More informationOn the Aggregation of Subjective Inputs from Multiple Sources
Washington University in St. Louis Washington University Open Scholarship Engineering and Applied Science Theses & Dissertations Engineering and Applied Science Spring 5-15-017 On the Aggregation of Subjective
More informationCorrelated Equilibrium in Games with Incomplete Information
Correlated Equilibrium in Games with Incomplete Information Dirk Bergemann and Stephen Morris Econometric Society Summer Meeting June 2012 Robust Predictions Agenda game theoretic predictions are very
More informationMechanism Design for Multiagent Systems
Mechanism Design for Multiagent Systems Vincent Conitzer Assistant Professor of Computer Science and Economics Duke University conitzer@cs.duke.edu Introduction Often, decisions must be taken based on
More informationPh.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012
Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012 The time limit for this exam is 4 hours. It has four sections. Each section includes two questions. You are
More informationIntroduc)on to Ar)ficial Intelligence
Introduc)on to Ar)ficial Intelligence Lecture 13 Approximate Inference CS/CNS/EE 154 Andreas Krause Bayesian networks! Compact representa)on of distribu)ons over large number of variables! (OQen) allows
More information