Crowdsourcing and All-Pay Auctions Milan Vojnovic Microsoft Research Lecture series – Contemporary Economic Issues – University of East Anglia, Norwich,

Slides:



Advertisements
Similar presentations
Crowdsourcing and All-Pay Auctions Milan Vojnović Microsoft Research Joint work with Dominic DiPalantino UC Berkeley, July 13, 2009.
Advertisements

The Weighted Proportional Resource Allocation Milan Vojnović Microsoft Research Joint work with Thành Nguyen Microsoft Research Asia, Beijing, April, 2011.
CPS Bayesian games and their use in auctions Vincent Conitzer
Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
ECON 100 Tutorial: Week 9 office: LUMS C85.
Mechanism Design without Money Lecture 1 Avinatan Hassidim.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Optimal auction design Roger Myerson Mathematics of Operations research 1981.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
Nash equilibria in Electricity Markets: A comparison of different approaches Seminar in Electric Power Networks, 12/5/12 Magdalena Klemun Master Student,
A Brief History of Game Theory From various sources.
Benjamin Johnson Carnegie Mellon University Are Security Experts Useful? Bayesian Nash Equilibria for Network Security Games with Limited Information TRUST.
Contests with Reimbursements Alexander Matros and Daniel Armanios University of Pittsburgh.
How to divide prize money?
Equilibrium Refinements Lifei Sheng 2014/01/23. Outline  Motivation of equilibrium refinements  Introduce different ways to refine Nash equilibrium.
EC102: Class 9 Christina Ammon.
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Competition Among Asymmetric Sellers with Fixed Supply Uriel Feige ( Weizmann Institute of Science ) Ron Lavi ( Technion and Yahoo! Labs ) Moshe Tennenholtz.
Endogenous Coalition Formation in Contests Santiago Sánchez-Pagés Review of Economic Design 2007.
Computer Systems seen as Auctions Milan Vojnović Microsoft Research Keynote talk ACM Sigmetrics 2010 New York, June 15, 2010.
Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.
6.1 Consider a simultaneous game in which player A chooses one of two actions (Up or Down), and B chooses one of two actions (Left or Right). The game.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Yang Cai Sep 15, An overview of today’s class Myerson’s Lemma (cont’d) Application of Myerson’s Lemma Revelation Principle Intro to Revenue Maximization.
The Weighted Proportional Allocation Mechanism Milan Vojnović Microsoft Research Joint work with Thành Nguyen Harvard University, Nov 3, 2009.
Mechanism Design Milan Vojnović Lab tutorial, March 2010.
Auction Theory Class 2 – Revenue equivalence 1. This class: revenue Revenue in auctions – Connection to order statistics The revelation principle The.
Game Theory The Prisoner’s Dilemma Game. “Strategic thinking is the art of outdoing an adversary, knowing that the adversary is trying to do the same.
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
3.1. Strategic Behavior Matilde Machado.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Intermediate Microeconomics
Auction and Markets Professor Robert A. Miller January 2010 Teaching assistant:Hao Xue
Mergers and Collusion in All-Pay Auctions and Crowdsourcing Contests Omer Lev, Maria Polukarov, Yoram Bachrach & Jeffrey S. Rosenschein AAMAS 2013 St.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 4.1.Dynamic Games of Incomplete Information Lecture
Lecture 4 Strategic Interaction Game Theory Pricing in Imperfectly Competitive markets.
Chapter 1. What is “Markets and Strategies”?
Efficiency and the Redistribution of Welfare Milan Vojnovic Microsoft Research Cambridge, UK Joint work with Vasilis Syrgkanis and Yoram Bachrach.
Analyzing Unique-Bid Auctions for Fun and Profit Ory Samorodnitzky Eran Tromer Avishai Wool.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
Roadmap: So far, we’ve looked at two polar cases in market structure spectrum: Competition Monopoly Many firms, each one “small” relative to industry;
Static Games of Incomplete Information
ECO290E: Game Theory Lecture 13 Dynamic Games of Incomplete Information.
SBE Supply Chain Seminar Series Nov. 30, 2007 Slide #1 Inventory Competition for Newsvendors under the Profit (and Revenue) Satisficing Objective Xuan.
Intermediate Microeconomics Game Theory and Oligopoly.
Rationality and Irrationality of Auction Bidders Interdisciplinary Perspective Joanna Białynicka-Birula Cracow University of Economics POLAND.
QR 38 Conclusion, 5/3/07 I.Why game theory is a useful tool for studying international relations II.Key insights from game theory for IR III.Limitations.
Chapter 6 Extensive Form Games With Perfect Information (Illustrations)
Extensive Form Games With Perfect Information (Illustrations)
Firms Overview  Perfect Competition and Monopoly= Extremes  Oligopolies and Monopolistically Competitive Firms= Dominate U.S. economy  Monopolistically.
Today n Oligopoly Theory n Economic Experiment in Class.
Strategic Management/ Business Policy Power Point Set #9: Game Theory and Strategy.
Comp/Math 553: Algorithmic Game Theory Lecture 11
Microeconomics Course E
Intermediate Microeconomics
Bayesian games and their use in auctions
Strategic Management/ Business Policy
For modeling conflict and cooperation Schwartz/Teneketzis
Contests with a non-convex strategy space
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 2 Bayesian Games Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Economics and Computation
Strategic Management/ Business Policy
Economics and Computation
M9302 Mathematical Models in Economics
Information, Incentives, and Mechanism Design
CPS Bayesian games and their use in auctions
Presentation transcript:

Crowdsourcing and All-Pay Auctions Milan Vojnovic Microsoft Research Lecture series – Contemporary Economic Issues – University of East Anglia, Norwich, UK, November 10, 2014

This Talk An overview of results of a model of competition-based crowdsourcing services based on all-pay auctions Based on lecture notes Contest Theory, V., course, Mathematical Tripos Part III, University of Cambridge - forthcoming book 2

Competition-based Crowdsourcing: An Example 3 CrowdFlower

Statistics TopCoder data covering a ten-year period from early 2003 until early 2013 Taskcn data covering approximately a seven-year period from mid 2006 until early

Example Prizes: TopCoder 5

Example Participation: Tackcn A month in year players contests

Game: Standard All-Pay Contest 7

Strategic Equilibria A pure-strategy Nash equilibrium does not exist In general there exists a continuum of mixed-strategy Nash equilibrium Moulin (1986), Dasgupta (1986), Hillman and Samet (1987), Hillman and Riley (1989), Ellingsen (1991), Baye et al (1993), Baye et al (1996) There exists a unique symmetric Bayes-Nash equilibrium 8

Symmetric Bayes-Nash Equilibrium 9

Quantities of Interest 10

Quantities of Interest (cont’d) 11

Total vs. Max Individual Effort Chawla, Hartline, Sivan (2012) 12

Contests that Award Several Prizes: Examples KaggleTopCoder 13

Rank Order Allocation of Prizes 14 V. – Contest Theory (2014)

Rank Order Allocation of Prizes (cont’d) 15 V. – Contest Theory (2014)

The Limit of Many Players 16 Archak and Sudarajan (2009)

When is it Optimal to Award only the First Prize? In symmetric Bayes-Nash equilibrium both expected total effort and expected maximum individual effort achieve largest values by allocating the entire prize budget to the first prize. Holds more generally for increasing concave production cost functions Moldovanu and Sela (2001) – total effort Chawla, Hartline, Sivan (2012) – maximum individual effort 17

Importance of Symmetric Prior Beliefs 18 V. - Contest Theory (2014)

Optimal Auction Myerson (1981) 19

Optimal All-Pay Contest w.r.t. Total Effort 20

Optimal All-Pay Contest w.r.t. Max Individual Effort Chawla, Hartline, Sivan (2012) 21

Simultaneous All-Pay Contests players contests 22

Game: Simultaneous All-Pay Contests 23

Mixed-Strategy Nash Equilibrium 24 V. – Contest Theory (2014)

Quantities of Interest 25 V. – Contest Theory (2014)

Bayes Nash Equilibrium DiPalantino and V. (2009) 26

Example: Two Contests Class 1 equilibrium strategyClass 2 equilibrium strategy 27 V. – Contest Theory (2014)

Participation vs. Prize Value Taskcn 2009 – logo design tasks any rate once a monthevery fourth dayevery second day 28 model DiPalantino and V. (2009)

Conclusion A model is presented that is a game of all-pay contests An overview of known equilibrium characterization results is presented for the case of the game with incomplete information, for both single contest and a system of simultaneous contests The model provides several insights into the properties of equilibrium outcomes and suggests several hypotheses to test in practice 29

Not in this Slide Deck Characterization of mixed-strategy Nash equilibria for standard all-pay contests Consideration of non-linear production costs, e.g. players endowed with effort budgets (Colonel Blotto games) Other prize allocation mechanisms – e.g. smooth allocation of prizes according to the ratio-form contest success function (Tullock) and the special case of proportional allocation Productive efforts – sharing of a utility of production that is a function of the invested efforts Sequential effort investments 30

References Myerson, Optimal Auction Design, Mathematics of Operations Research, 1981 Moulin, Game Theory for the Social Sciences, 1986 Dasgupta, The Theory of Technological Competition, 1986 Hillman and Riley, Politically Contestable Rents and Transfers, Economics and Politics, 1989 Hillman and Samet, Dissipation of Contestable Rents by Small Number of Contestants, Public Choice, 1987 Glazer and Ma, Optimal Contests, Economic Inquiry, 1988 Ellingsen, Strategic Buyers and the Social Cost of Monopoly, American Economic Review, 1991 Baye, Kovenock, de Vries, The All-Pay Auction with Complete Information, Economic Theory

References (cont’d) Moldovanu and Sela, The Optimal Allocation of Prizes in Contests, American Economic Review, 2001 DiPalantino and V., Crowdsourcing and All-Pay Auctions, ACM EC 2009 Archak and Sundarajan, Optimal Design of Crowdsourcing Contests, Int’l Conf. on Information Systems, 2009 Archak, Money, Glory and Cheap Talk: Analyzing Strategic Behavior of Contestants in Simultaneous Crowsourcing Contests on TopCoder.com, WWW 2010 Chawla, Hartline, Sivan, Optimal Crowdsourcing Contests, SODA 2012 Chawla and Hartline, Auctions with Unique Equilibrium, ACM EC 2013 V., Contest Theory, lecture notes, University of Cambridge,