On Manipulation in Prediction Markets When Participants Influence Outcomes Directly
|
|
- Octavia Mathews
- 6 years ago
- Views:
Transcription
1 On Manipulation in Prediction Markets When Participants Influence Outcomes Directly Paper XXX ABSTRACT Prediction markets are popular mechanisms for aggregating information about a future event such as the outcome of an election. In situations where market participants may significantly influence the outcome (as in an election with a small number of voters running the prediction market could change the incentives of participants in the process that creates the outcome (e.g. agents may want to change their vote in the election. We propose a new game-theoretic model that captures two aspects of real-world prediction markets: ( agents directly affect the outcome the market is predicting ( some outcome-deciders may not participate in the market. We show that this game has two different types of equilibria; when some outcome-deciders are unlikely to participate in the market equilibrium prices reveal expected market outcomes conditional on market participants private information whereas when all outcomedeciders are likely to participate equilibria are collusive participants effectively coordinate in an uninformative and untruthful way. Finally we suggest an approach towards incentivizing truthfulness by subsidizing agents appropriately using ideas from peer prediction. Categories and Subject Descriptors J. [Social and Behavioral Sciences]: Economics; K.. [Electronic Commerce]: Payment Schemes General Terms Economics Keywords Information Elicitation Prediction Markets Market Scoring Rule Manipulation Peer Prediction. INTRODUCTION Prediction markets are platforms designed to aggregate and disseminate information bearing on some future event dispersed among a potentially diverse crowd. It is generally assumed that market participants may have superior information about the relevant event but have no direct control Appears in: Proceedings of the th International Conference on Autonomous Agents and Multiagent Systems (AA- MAS 05 Bordini Elkind Weiss Yolum (eds. May 8 05 Istanbul Turkey. Copyright c 05 International Foundation for Autonomous Agents and Multiagent Systems ( All rights reserved. over the outcome. However prediction markets are often used in situations where this assumption is violated to a greater or lesser degree. In fact sometimes it is this very potential for violation that gives agents the informational edge that such markets get their value from. If market participants can influence event outcomes it is natural to ask to two questions: ( Are the actions of the outcome-deciders still truthful i.e. do they take the same actions that they would in absence of the prediction market? ( Are market prices still informative or in other words how much do they still tell us about the realized outcome? Consider three canonical real-world examples where prediction markets (or betting markets have demonstrated their forecasting ability to great effect: politics [3] sporting events [39] and software product releases []. In each of these cases it is easy to see how the presence of a prediction market on the event may make agents affecting the outcome act differently than they otherwise would. A congressional staffer or member of congress may know more about the probable outcome of a key vote than the general public but she is also in a position to influence said outcome. A referee or player has substantial ability to influence the outcome of a sporting event. A software engineer has the potential to delay (or speed up the release of a product. While it is acknowledged that prediction markets have value as forecasting tools that may help in making business and policy decisions they have gone through cycles of hype and bust for reasons that include regulatory concerns about manipulation. The emblematic anecdote about this problem is the failure of DARPA s proposed Policy Analysis Markets which were caricatured in the media as terrorism futures [0 3]. There are obviously markets that will not work but stock and futures markets have been used for a long time as predictive tools and prediction markets are no different in essence. The key is to understand when markets may be prone to manipulation and how much to trust them. We are not concerned with markets where an individual has a very small effect on the outcome (like large elections. So for the first part of the paper where we theoretically investigate potential incentives for manipulation and consequences thereof we restrict ourselves to a twoplayer model which helps us understand worst case manipulative behavior. Our model captures the two aspects of real-world prediction markets that we are interested in: ( agents directly affect the outcome that the market is set up to forecast ( some of the agents who have influence over the outcome may not participate in the prediction market (e.g. people who have an impact on the outcome of a basket-
2 ball game such as the players the coaches and the referees typically do not all take part in a betting market for that game. Among other things we study what effect if any the uncertainty around the participation of some outcomedeciders has on the actions of a strategic agent when there is incentive for manipulation.. Contributions The model of prediction markets we formulate in this paper is a two-stage game involving two players or agents whom we call Alice and Bob. Before the game commences each agent receives some true private signal about the underlying entity (e.g. for the vote-share prediction market of a two-candidate election the entity would be one of the two candidates. In the first stage of the game both players have the opportunity to participate (sequentially in a prediction market where trades are mediated by a market scoring rule or MSR [9] market-maker. Alice moves first; Bob may or may not participate in trading and if he does participate he goes second. In the second stage the two players simultaneously (and independently take public actions which we term votes for convenience although in general they model each participant s role in determining the outcome. In our model voting is identical to announcing a signal (not necessarily one s true signal. The payoffs from the stage-one prediction market are determined by a simple function specifically the arithmetic mean of the stage two votes. If Bob has not traded his vote is truthful (i.e. consistent with his private signal otherwise he is strategic; Alice is always strategic. The analysis of this simple model yields many interesting insights. Our main result on this model is that the equilibria of the game can be cleanly categorized into two types depending on Bob s probability of participation in the trading stage. Below a threshold on Bob s said participation probability say p we call the equilibrium a low participation probability (LPP equilibrium and above p we call it a high participation probability ( equilibrium. The threshold p itself depends on the MSR used and Alice s belief about Bob s signal. In a LPP equilibrium Alice essentially predicts Bob s vote and then bases her trading on the optimal combination of her own vote and Bob s vote and the prediction market price is reflective of the expected outcome. In a equilibrium on the contrary Alice effectively expects Bob to enter and collude with her and she chooses a prediction market price that allows Bob and her to split the profit (not necessarily evenly. We can examine the characteristics of these equilibria from two perspectives the information conveyed by market prices about the outcome of the vote (keeping in mind that voting may be strategic and whether or not Alice and Bob reveal their true signals in the voting stage. The results are summarized below. Informativeness of prices. If Bob does trade the price he updates the market to will be equal to the average vote and hence an accurate forecast. The price after Alice trades in a LPP equilibrium will be equal to Alice s posterior expectation of the average vote given her signal and her trading action and therefore an effective disseminator of information. In equilibria the price after Alice trades is insufficient for revealing her signal but is still indicative of her own vote and also determines Bob s vote if he participates in the market hence contains partial information about the outcome. Truthfulness of outcomes. The trading actions of either agent do not necessarily reveal their private signals directly: Regardless of whether the equilibrium is LPP or if Bob does end up participating in the trading stage his vote is fully determined already by Alice s trading choice independent of his signal. Alice s trading decision on the other hand is based on her belief about Bob s signal which in our Bayesian setting has an indirect dependence on her own information. In fact under the mild assumption of stochastic relevance [6] of Alice s signal for that of Bob we can recover Alice s true signal from her price-update in a LPP equilibrium. Alice s equilibrium price-update is still uninformative about her private signal a limiting case being the situation when Bob s participation is certain. Value of prediction markets when participants influence outcomes substantially. In situations where the second phase ( voting is already assumed to be truthful a market designer might wish to ensure that she did not make it untruthful just because she added a prediction market. One major implication of our model is that adding the prediction market is less likely to produce damaging incentives when some fraction of the outcome-deciders refrain from market participation and are truthful in their outcome-affecting actions. This is suggested by the previous paragraph: for a sufficiently high probability that the successor (Bob will not trade and will vote truthfully the predecessor though strategic is forced to act in a way that divulges her private information indirectly. Choice of market scoring rule. We present results for three different MSRs from the literature: logarithmic (LMSR quadratic and spherical. The merits of LMSR for prediction market design are well documented. We identify an additional property that is pertinent to our outcome manipulation model: when Alice is highly uncertain about Bob s private signal the threshold p on Bob s participation probability to be crossed for the uninformative collusive equilibrium domain to set in is significantly higher than those for the other two MSRs. Relatedly Alice and Bob split the profits more evenly with LMSR than with the other two MSRs in a equilibrium. Incentivizing truthful trading and voting. In Section 5 we return to the market design question and extend our model to n participants. We propose a remedy for manipulation when the principal can directly incentivize participants by introducing a payment scheme based on the Peer Prediction Method [6] for the voting mechanism. We also analyze the level of subsidy needed in the combined prediction/voting mechanism.. Related Work This paper relates to three major strands of literature: ( Incentives and manipulation in prediction markets ( Insider trading in financial markets (3 Information elicitation when the ground truth is not revealed [35]. The market microstructure we use in our model is a market scoring rule (MSR introduced by Hanson [8] and ex-
3 panded upon by many researchers ([ 8] inter alia. Incentives for manipulation in prediction markets may arise in a number of ways. There is a plethora of literature on price manipulation tampering with the market price owing to some extra-market incentives ( [ ] e.g. a politically motivated manipulator might make a large investment in an election prediction market to make one of the candidates appear stronger [3]; a related body of work pertains to decision markets a collection of contingent markets set up to predict the outcomes of different decisions such that only markets contingent on decisions that are taken pay off the rest being voided [7 8 0]. Another type of manipulation that has received some attention is outcome manipulation where an agent can take an action that partially influences the outcome to be predicted (e.g. [ 33]. Here we concern ourselves with the second type of manipulation and the model we use is different from those considered in the above publications. Our model directly captures the prediction market experiments of Chakraborty et al. [7] where students in a class gave their instructor an up/down rating at the end of every two-week period during which a prediction market where those students as well as some outsiders could participate tried to forecast the fraction of up ratings received by the instructor. The second major body of literature comes from theoretical finance and market microstructure. Kyle [5] followed up by [3 5] etc. studied the effect of informed insider(s on market price; Glosten and Milgrom [6] presented another view of how asymmetric information affects price formation and their model has been adapted for market making in prediction markets [3 6]. Ostrovsky [7] recently examined information aggregation with differentially informed traders under both Kyle s pricing model and market scoring rules. Again in all of these models the liquidation value is assumed to be exogenously determined unlike in ours. In the last part of this paper we draw from the literature on truth-telling incentives in traditional means of information gathering such as surveys polls etc. Two important contributions in this vein are the Bayesian Truth Serum (BTS [ ] and the Peer Prediction (PP method ([6 38] and references therein. The situations of interest in this paper are not the ones for which BTS or PP were designed; these are intended to solve the problem of getting people to vote or give their opinion. Our focus is on settings where people would already vote / give their opinion / do their work honestly but the introduction of a prediction market may affect their incentive to do so. Therefore while ideas from this literature will prove useful we cannot simply apply BTS or PP in the first place and ignore the existence of the prediction market.. TWO-PLAYER MODEL Let τ T denote the unobservable type of the entity on which the voting system and its associated prediction market are predicated. At t = 0 the two agents Alice and Bob (A and B in subscripts receive private signals s A s B Ω = {0 } respectively. The belief structure comprising the prior distribution Pr(τ on the type and the conditional joint distribution Pr(s A s B τ of the private signals given the type are common knowledge. Let ( denote Alice s posterior probability that Bob received the signal s B = 0 given her own signal and common knowledge i.e. (s Pr (s B = 0 s A = s s {0 }. We need no further assumptions on the belief structure for our main result (Theorem since it depends only on the magnitude of regardless of how it is evaluated. We shall later discuss a specific belief structure. However it is worthwhile to define here the property of stochastic relevance [6] which has no bearing on our main result but is a necessary assumption for one of our important corollaries. Definition. For binary random variables s i s j {0 } s j is said to be stochastically relevant for s i if and only if the posterior distribution of s i given s j is different for different realizations of s j i.e. if and only if Pr(s i = 0 s j = 0 Pr(s i = 0 s j =. We now describe the market and voting mechanisms (common knowledge. Stage (market stage: The market price at any timestep t is public the starting price at t = 0 being p 0 which is the baseline estimate of the liquidation value (the final gross payoff per unit of the prediction market security. We set p 0 = which is the standard initialization for prediction markets thus assuming that the market maker starts off with no strong beliefs one way or the other. The market is implemented using a Market Scoring Rule (MSR [9]. Let s(r ω denote the underlying strictly proper scoring rule where ω is the true outcome or state of the world and r is a forecast/report on it (not the associated probability see []. In this paper we consider three representative market scoring rules namely logarithmic quadratic and spherical defined as follows : LMSR: s(r ω = ω ln r + ( ω ln( r QMSR: s(r ω = ω (ω r SMSR: s(r ω = (rω + ( r( ω / r + ( r. At t = Alice interacts with the market maker and changes the price to p A. At t = Bob has an opportunity to trade but may not show up with a probability π [0 ] which is called Bob s non-participation probability and is also common knowledge; if he does trade he changes the price to p B. Regardless of whether Bob trades the market terminates after t =. Stage (voting stage: Alice and Bob simultaneously declare their votes v A v B Ω = {0 } respectively. We define truthful voting as declaring one s private signal i.e. v k = s k k {A B}. If Bob did not trade in the first stage we assume that he votes truthfully; any agent participating in the prediction market is Bayesian strategic and riskneutral. The liquidation value of the security is given by v = (v A + v B / {0 }. The net payoffs of Alice and Bob are given by r i = s ( p i v A+v B ( s pj v A+v B ( where i {A B} j = 0 for i = A j = A for i = B. These formulations apply to prediction markets where the reports or forecasts are not probabilities but values of continuous random variables in [0 ]. Similar formulations were used by [7] for theoretical analyses and in [7] for experiments. In general we can have v = αv A + ( αv B α (0 where α models Alice s degree of control over the final outcome. In this paper we focus on the special case α = as a starting point where both agents are equally powerful.
4 Note that unlike in a traditional prediction market the underlying type τ is never revealed. Nevertheless if every agent were to vote truthfully (and this were common knowledge then it is easy to see from the properties of market scoring rules that an agent s expected net payoff would be maximized by moving the market price to their posterior expectation of the liquidation value v. With this in mind p A and p B will be sometimes referred to as the reports (on the market outcome of Alice and Bob respectively. 3. EQUILIBRIUM ANALYSIS OF THE TWO- PLAYER GAME We now present our main result for the case p 0 = ; they generalize easily (with different numerical values to cases where p 0. Theorem. For any π [0 ] and (0 \{ } the game described above has a unique perfect Bayesian equilibrium. For every there exists a fixed value of Bob s non-participation probability say π c( which we call the crossover probability (dependent on the MSR on either side of which the equilibria are qualitatively different. We call the sub-interval π < π c the high participation probability ( equilibrium domain and the sub-interval π > π c the low participation probability (LPP equilibrium domain. In a equilibrium: In Stage Alice moves the market price to p A = p L if > and to pa = ph if < ; pl ( 0 p H ( are functions of the MSR only 3 and independent of π. If Bob trades his price-update is p B = 0 if p A = p L and p B = if p A = p H. In Stage Alice votes v A = 0 if she set p A = p L v A = if p A = p H. If Bob participated in Stage he votes v B = 0 if he set p B = 0 and v B = if he set p B =. In a LPP equilibrium: In Stage Alice s price-report p LP A P is equal to her posterior expection of the market liquidation value (average vote given the parameters π and her report p LP A P i.e. p LP A P = E [ ] v π p A = p LP A P. Moreover p LP P A < if q0 > p LP A P > if q0 <. If Bob trades his price-update is p B = 0 if p L p A pb = if < pa ph and p B = otherwise. In Stage Alice votes v A = 0 if p A > va = if pa <. If Bob traded he votes v B = 0 if p A [ ] ( p L p H ] v B = otherwise. More specifically p LP A P is one of µ 00 = π( µ 0 = π µ 0 = +π( µ = π where µ 00 < µ 0 < < µ0 < µ π q0. Tables and 3 detail the dependence of Alice s equilibrium trading action p P A BE on π for LMSR QMSR and SMSR respectively. Figure depicts π c as a function of for each of the three MSRs. Proof. The following lemmas spell out the effect of Alice s price-update on her vote and Bob s best response to the trading choice made by Alice. The proofs involve simple algebra and hence are omitted. Lemma. If p A > p 0 = (resp. pa < then Alice s rational vote is v A = (resp. v A = 0 regardless of p B v B. 3 ( p L p H are ( 5 5 ( 3 ( for LMSR QMSR SMSR respectively. π p P A BE (LMSR Domain 0 < < 0 π < x L ( 5 5 x L ( < π < 5 µ 0 LPP 5 < π µ LPP = 0 π q0 < 0 π < < π µ LPP = 0 π < < π µ00 or µ LPP 5 q0 < 3 0 π < 5 5( p L = 5 < π µ00 LPP 5( = π 3 5 q0 < 0 π < y L ( 5 5 yl ( < π µ 0 LPP x ( is the unique solution to the fixed point equation x = ln 6 ln(5( x x (+x +x ( q0 ln ( q0 ln in ( 3 5 q0 for q0 < 5 ; yl ( is the unique solution to the fixed point equation y = ln 6 ln(5( y y (+y +y in ( 3 5 q0 for q0 > 3. 5 Table : Alice s PBE price-report for LMSR market p 0 =. π p P A BE (QMSR Domain 0 < < 0 π < x Q ( 3 x Q ( < π µ 0 LPP = 0 π or 3 < q0 < 0 π < y Q ( y Q ( < π µ 0 LPP x Q ( = y Q ( = 3+v v v = 3+u u u =. ; Table : Alice s PBE price-report for QMSR market p 0 =. Lemma. If p A > (resp. pa < then Bob s rational vote is v B = if p A p H also (resp. if p A < p L also and is v B = 0 otherwise regardless of s B. Since Bob knows v A from p A and also his best v B he can set p B = (v A + v B/. Now that we have figured out Alice s vote as well as Bob s report-vote pair given Alice s trading choice it remains to show that Table gives Alice s expected payoff-maximizing actions for different parameter values. We sketch the proof for LMSR those for the other two being analogous. A little thought reveals that our maximization problem requires the analysis of a piecewise smooth function described by f uv(p = ln ( p µuv ( p µuv where (u v = (0 (0 0 ( ( 0 over the intervals [ 0 5 [ 5 ] ( 5 ] ( 5 ] respectively. These (u v pairs are the rational votes of Alice and Bob in the respective regions and the µ uv s are as defined above. It is easy to show that these µ uv s are the global maximizers of the corresponding f uv s over
5 Cross over probability π c LMSR QMSR LPP 0.8 LPP 0.8 LPP Alice s posterior probability of Bob s signal being 0 ( SMSR Figure : Dependence of crossover probability on Alice s posterior belief about Bob for the three MSRs; e.g. for QMSR if = 0.5. then π c so we have a LPP equilibrium with p A = ( + π( / for π > and a equilibrium with p A = p H = 0.75 for π < Note that for LMSR when 0. < < 0.6 the crossover probability actually decreases with Alice s increasing uncertainty unlike for the other two! This can be attributed to a difference in the shapes of the MSRs. π p P A BE (SMSR Domain 0 < < 0 π < x S ( x S ( < π µ 0 LPP = 0 π < π S 0.75 or πs < π µ 0 or µ 0 LPP q0 < 0 π < y S ( 0.75 ys ( < π µ 0 LPP K +K v K 3 v x S ( = K v = v ; ys K ( = +K u K 3 u K u = u ; K = ( ; K = (3 0.76; K 3 = 3 + ( ; πs = ( K + K K 3 /( K Table 3: Alice s PBE price-report for SMSR market p 0 =. 0 p. However the overall function is ill-behaved with jump discontinuities at and since f00(0. > f0(0. and 5 5 f (0.8 > f 0(0.8 in general; moreover it changes its form drastically depending on the relative magnitudes of π and. It is thus impossible to analyze the function without considering the plethora of cases enumerated in Table. This makes the complete proof lengthy though straightforward and so we relegate it to a full version of the paper owing to paucity of space. Here we present part of the proof for the representative case < q0 < 3 π > 5 5( which adequately demonstrates the methodology we employ for prov- ing the relevant results for all such cases. Notice that the constraint < 3 ensures < 5 5( so that the condition π > is achievable. Now π > 5( implies 5( µ00 = π( > so that 5 µ0 > µ00 > 5 too. So f 00 is maximized at p = µ 00 ( 5 whereas f 0 is monotonically increasing in [ 0 5 and on this interval f 0(p < f 0(0. < f 00(0. < f 00(µ 00. Thus the local maximum of Alice s payoff for p < is attained at p = µ 00 and is given by ˆf 00 = h(µ 00 where h(x = b ln ( µ µ ( µ00 µ 00 x (0. Since > we have > 5( 5. So π > implies π > 5( 5. Hence by arguments similar to the above we obtain µ 0 < µ < which in turn leads to the conclusion that the local maximum of Alice s payoff for p > is ˆf = h(µ. But since 5 the function h(x is symmetric about its unique minimizer x = q0 > µ00 > µ h(µ00 > h(µ. ( Thus the best trading action for Alice is p A = µ 00 5 followed by the vote va = 0. This also implies from Lemma that v B = 0 if Bob trades. Hence Bob s expected vote from Alice s perspective is ˆv B = π( 0 + ( + ( π 0 = π( making the expected average vote from Alice s perspective ˆv = (0 + ˆv B/ = µ 00 = p A. Proceeding along similar lines for other possible parameter values (π we can complete the proof. 3. Implications Corollary. If Alice s signal s A is stochastically relevant for Bob s signal s B then the value of s A can be recovered from Alice s price-report in a LPP equlibrium p LP A P = µ uv (π u v {0 } regardless of whether v A = s A. Proof. By observing which sub-interval ( 0 p L [ p L ( ph] or ( p H contains Alice s LPP price-report we can infer v A and v B (Lemmas and and hence which µ uv u v {0 } equals p A. Since π is common knowledge we can solve for from the expression for µ uv. Under the assumption of stochastic relevance (s A is one-to-one so we can deduce s A uniquely from its value. Private signal revelation. Unfortunately if Bob trades his report-vote pair is fully determined by Alice s report and does not depend on s B. There is no guarantee that Alice s vote will be truthful either even in a LPP equilibrium (in general she is likely to guess which way Bob will vote and vote the same way.
6 What is still somewhat interesting is that the very possibility of Bob not trading but voting truthfully engenders a situation (LPP domain in which Alice s trading action indirectly reveals her private information (Corollary! This stands in contrast to the situation where Bob s participation is certain the extreme case of the domain. In a equilibrium we can only tell whether > (if pa = pl or < (if pa = ph which is insufficient for recovering s A without further assumptions about the signal structure. profit sharing. The equilibria are a world where collusion appears with Alice as the leader picking the vote that both will coordinate on and pushing the price to just the level where it makes sense for Bob if he transacts with the market maker to push the price all the way to 0 or and vote the same way as Alice. In this way they extract the maximum profit from the market maker and split it between the two of them in a ratio that is MSR-dependent: Profit if Bob trades LMSR QMSR SMSR Alice s share in total profit 67.8% 75% 78.3% Bob s share in total profit 3.9% 5%.68% Thus for all three MSRs considered Alice makes more profit than Bob in a collusive equilibrium with the discrepancy being the least for LMSR. Informativeness of market prices about final outcome. Finally we can put all our results together into the following table (note that if Bob does not trade the the final price p B = p A and ih does then p B = v where Bayes. Est. (Bayesian estimate is Alice s expectation of the average vote before Bob trades; Pre. (Predetermined signifies p A {p L p H }; Correct denotes the actual outcome. Bob trades Bob does not trade LPP LPP p A Bayes. Est. Pre. Bayes. Est. Pre. p B Correct Correct Bayes. Est. Pre. 3. A specific belief structure Thus far we have been non-specific about the signal structure proving general results; we now consider a concrete example scenario to illustrate our findings: The type space of the entity is identical to the signal space i.e. T = Ω = {0 } the prior probability of type 0 being ρ 0 (0. Given the type τ the agents signals are independently and identically distributed: for any true type of the entity each participant gets the correct signal (identical to said true type with probability ( ρ e otherwise gets the wrong signal; the error probability ρ e (0 \{ }. Then (0 = ( ρ e ρ 0 +ρ e ( ρ 0 ( ρ ( ρ eρ 0 +ρ e( ρ 0 and q 0( = eρ e ρ eρ 0 +( ρ e( ρ 0. This belief structure has multiple interesting information-revealing characteristics: First for any admissible ρ 0 and ρ e we have (0 ( i.e. Alice s signal is stochastically relevant for that of Bob. Hence Corollary applies. Second it is easy to show that if ρ 0 = (a uniform common prior then Alice s vote is always truthful since for any ρ e (0 s A = 0 > va = 0. Note that iff ρ e = q0(0 = q0( = regardless of ρ 0 hence signals are not informative [8] i.e. the prior and posterior probabilities are equal. Figure shows Alice s equilibrium report in a LMSR market and her expected liquidation value vs. π for fixed ρ 0 ρ e (hence a fixed. The and LPP regions are clearly visible to the left and right of the cross-over probability. The corresponding plots for the other two MSRs are qualitatively similar hence omitted. Alice s best response and expected liquidation value LMSR; Alice s signal s =0; error probability ρ =0.; prior ρ = A e Alice s price update p A Alice s posterior expected liquidation value Probability of Bob not participating Figure : Crossover from to LPP equilibria regions for LMSR over 0 < π < for fixed prior and likelihood structure ( = 0.5. For any π < π c = 0./( Alice updates price to p HP A P = 0.; for π > she moves the price p LP A P her posterior expectation of average vote (given Bob votes truthfully if he does not trade.. DISCUSSION AND EXTENSIONS We have presented a stylized model above that captures the essence of several outcome manipulation scenarios in prediction markets. Here we briefly sketch how it can apply to some more realistic scenarios and discuss the insights our results offer for these scenarios. First Alice and Bob s effect on the outcome could be stochastic rather than deterministic the outcome could be drawn from a probability distribution whose mean is their average vote. For example whether or not a product gets finished on time could be a stochastic function of the effort put in by the key players. It is easy to see that our analysis still holds as the expressions for expected payoffs remain unchanged. A second generalization is a scenario where there are traders in the prediction market other than Alice and Bob but these traders have no control over the relevant outcome. To test how the equilibrium strategies implied by Theorem fare in such scenarios we ran some simple simulations. Again Alice moves first (the market starting at p 0 = 0.5; preceding traders only matter in how they would move the previous price but she is followed by a sequence of 0 zerointelligence budget-limited traders; Bob then arrives at the market with probability π and trades if he does arrive. As before the outcome is Alice and Bob s average vote (note that successors of Bob if any do not matter in a MSR-based market since they have no effect on the payoffs of Alice or Bob. Each intervening trader obtains her private signal from the same source as the outcome-deciders and then draws her belief from a beta distribution with mean equal to her own posterior expectation of the outcome which is
7 Strategic Bob Truthful Bob (if trades (if trades Strategic Alice Truthful Alice Table : Alice and Bob s expected profits for being strategic vs. truthful with 0 intervening traders. The signal struture is similar to that in Section 3. with ρ 0 = 0.5 ρ ɛ = 0. π = 0.. The variance of each intermediate trader s beta distribution is m( m/ where m is her posterior expected outcome. The budget B = 0.5. The results are averaged over 0 5 simulations. The first entry in each cell corresponds to Alice the second to Bob. Note that strategic in the above table denotes the use of strategies implied by Theorem and described in Section the table obviously does not list all strategies available to the players and does not depict the equilibrium; it merely shows that Theorem strategies outperform (for both players any strategy-pair in which at least one is truthful. We observed similar results for the other parameter conbinations we tried. equal to her posterior expectation of another agent s signal assuming that she is oblivious to the existence of manipulators; she then moves the market price as much towards her belief as her budget allows (for further details on the budget constraint see Section 5. This budget constraint captures the intuition that agents who do not influence an outcome and/or have poor knowledge thereof should be conservative in their trading decisions. As in the above sections it is easy to show that Alice s vote is revealed immediately after she trades (in practice insiders are often big players so it is not unrealistic to suppose that they are identified by other traders hence Bob (if he trades can base his actions on Alice s inferred vote and his immediate predecessor s report. The problem is still easy for Bob since he knows the previous report and can infer Alice s vote. How should Alice play? This is a strategically more complex game and finding equilibrium strategies may be difficult. However one possibility is for Alice to simply ignore the existence of the intermediate traders and use her strategy from Theorem. While this is not necessarily an equilibrium (or a priori even a good strategy in our simulations (Table we see that it significantly improves upon another simple alternative the truthful strategy (which means declaring one s true signal as the vote after updating the price to one s posterior expectation of the average signal. Thus the model may well have predictive value even in this more complex setting. Finally our theoretical results apply to situations where Alice the first mover controls exactly half of the outcome but in general we would expect Alice to have less than 50% control over the outcome and for there to be several participants in determining the outcome. Moreover traders could also strategically pick the time-points at which they interact with the market. These are important generalizations and we believe that our model can serve as a foundation for further research on them. 5. INCENTIVIZING TRUTHFUL TRADING AND VOTING We now propose a design for the combined two-stage tradingvoting mechanism ( voting again being a metaphor for an agent s outcome-affecting action for the general case of n agents (n that disincentivizes manipulative behavior. The basic model is a natural extension of that described in Section but this section is independent of the analysis in Section 3. In the first stage of the game the n agents trade in a prediction market in some pre-determined order and then simultaneously choose their actions v i Ω (not necessarily binary in the second stage the market liquidation value v being some function of {v i} n i= (not necessarily the average. Each agent has zero non-participation probability in the market and trades exactly once. Thus although the myopic assumption still holds the scenario is adversarial in the sense that all outcome-deciders participate deterministically in the prediction market. The number of participants n as well as the belief structure on the underlying type τ and the agents private signals {s i} n i= is common knowledge. Let us denote the agents price reports {p i} n i= the starting market price being p 0. Here we demonstrate our approach with a LMSR market with liquidity parameter b the treatment for other scoring rules being similar. Although the worst-case loss in a traditional LMSR market is bounded it is theoretically possible for an individual trader to earn an unbounded profit from it. To circumvent this issue we place a fixed budget B on every agent (i.e. each agent trades in such a way that their loss can never exceed B. 5 From the properties of LMSR it can be easily shown that agent i can move the market price from their observed value p i to a maximum of p max = ( γ p i and to a minimum of p min = γp i where γ = e B/b p i = p i. Thus agent i s net payoff from the prediction market is ri P M (p i p i v = b [ v ln ( /pi /p i ( ] pi ln p i. ( Simple algebra shows that for each i the maximum and minimum possible values of the above under the budget constraint are r P M imax =b ln ( { γpi max γ } pi p i p i r P M imin = B = b ln γ. (3 Let ˆl i(v i denote agent i s posterior expectation of the liquidation value based on her decision to vote v i (declared signal and her inference from the common prior her private signal s i and the prices p 0 p... p i (assuming every other agent is Bayesian and truthful in both voting and trading and ˆr i P M ( p p i v i be her posterior expected net payoff from the market mechanism on updating the price from p i to any reachable p. From the above linear dependence of ri P M on v ˆr i P M is readily seen to be a simple linear function of ˆl i(v i. Our key idea is to introduce a compensation scheme for the voting mechanism such that the combined payoff from the market and the voting system when an agent is truthful 5 With the budget constraint the market may lose some of its expressiveness [] i.e. a trader may not be able to update the market price so as to coincide with their estimate of the liquidation value but it is still directionally expressive in the sense that it is still rational for an agent to shift the price as close to said estimate as possible.
8 in both stages (and believes that everyone else is going to be similarly truthful exceeds the largest profit she can make by deviating from truth-telling. A promising technique already proposed in the literature for achieving this end is the peer prediction scheme introduced by [6]. The following is a brief description thereof tailored to our setting. We choose a reference participant f(i a priori for agent i such that i s vote is stochastically relevant for that of f(i (the posterior is different for different realizations of the signal. At the end of voting the transfer made to participant i by the center is a function of the posterior on participant f(i s vote v f(i under the common prior likelihood and agent i s vote v i the function being a strictly proper scoring rule. Suppose we use a strictly proper scoring rule R( (not necessarily logarithmic so that agent i s peerprediction score is given by ri P P (v f(i v i = α ( ir g ( v f(i v i where g( is said posterior. Thus agent i s expected peerprediction score is ˆr i P P (s i v i = α iφ(s i v i where φ(s i v i = v f(i Ω R ( g ( ( v f(i v i g vf(i s i and g( is said posterior α i > 0 i = n. Miller et al show that truthful voting is a strict Nash equilibrium for this mechanism. The constants α i have no effect on the truth-telling incentives of the voting stage alone and we show below how to tune these free parameters to ensure honest behavior. Note that while the LMSR prediction market has a single parameter b that determines all its properties the proposed combined mechanism has n additional parameters. Now we can state our result: there is a way to set the parameters b and α i (which are under the designer s control that guarantees that the overall expected earnings ˆr i = P M (ˆr i + ˆr i P P for every i is uniquely maximized under the imposed constraints when their trading and voting are both consistent with their private information (in equilibrium. Let φ m = min ss Ω s s [φ(s s φ(s s ] which is strictly positive by the incentive compatibility of the peer-prediction method and is a function of the signal structure. Theorem. Let there be n participants in the above mechanism each with budget B. If we promise every agent i when she arrives to trade a peer- prediction payment with some α i satisfying α i > b φ m ln ( { } γpi max γ p i γ( p i γ( p i where all symbols have the meanings stated above then there exists an ex interim Bayes-Nash equilibrium where each agent i announces v i = s i in the outcome-deciding stage after having updated the market price as close as possible to her to truthful expected liquidation value i.e. p min if ˆli(s i < p min p i = ˆli(s i if p min ˆl i(s i p max otherwise. p max Proof. Part I: For any voting choice v i = v agent i s expected market liquidation value assuming everyone else to be truthful is ˆl i(v and since ˆr i P P is independent of p i from Equation ( it follows that ˆr i p i = ˆrP M i p i = ˆl i (v p i p i ( p i 0 pi ˆl i(s i. Part II: For proving that when subsidies are set to yield the conditions on α i above it is in an agent s best interest to pick her honest vote it suffices to show that for any possible signal values s s where s s and any feasible prices p p p ˆr i(s i = s p i = p p i = p v i = s > ˆr i(s i = s p i = p p i = p v i = s which reduces to α i[φ(s s φ(s s ] > ˆr i P M ( p p s ˆr i P M ( p p s. The greatest lower bound on the L.H.S. is by definition α i( φ m where φ m is a known constant and always strictly positive. An upper bound on the R.H.S. is obviously the range of all possible payoffs from the prediction market of agent i with budget B whose predecessor s price-report is p i i.e. (r P M imax r P M imin given by Equations (3. Thus setting α i to a value exceeding the (finite positive bound specified in the theorem statement is a sufficient condition for the desired inequality to hold. The two parts together complete the proof. If R( ln( then the raw peer-prediction scores ri P P are always negative so there is no incentive for voluntary participation. This problem can be solved as in [6] simply by subtracting from the raw score of agent i the constant α i min ss Ω(ln(s s which is a function of the prior and likelihood structures and independent of actual trader behavior. This ensures positive peer-prediction payments but also necessitates subsidization of the mechanism. For our budget-constrained LMSR market b ln is a (perhaps loose upper bound on its loss so the market subsidy is linear in b and independent of n. The amount of subsidy for the voting phase is proportional to n ( { i= αi. A reasonable } choice for α i is α i = κb γpi φ m ln max γ p i γ( p i γ( p i where κ is a constant slightly greater than. It is straightforward to show that ( ln ( ( φ m ( i+ αi ln ( γ γ κb γ + i γ assuming that the starting market price is 0.5. Since γ = e B/b it is clear that for fixed b α i is Ω(B and O(iB and for fixed i B it is Θ(. Hence the total peer prediction subsidy is linear in B independent of b and Ω(n and O(n. 6. DISCUSSION We have introduced a new formal model for studying incentive issues in prediction markets whose participants can affect the outcome by taking actions external to the market. An interesting feature of our model is the impact of uncertainty about the participation of some outcome-deciders. We have characterized the equilibria of the induced game and discussed their properties. Finally we have initiated the study of a methodology for incentivizing truthful behavior in the combined prediction-market/voting mechanism using ideas from the literature on peer prediction. This paper is a first step in exploring the crucial incentive issues that have the potential to derail the effectiveness or perceived effectiveness of prediction markets for various forecasting tasks. We believe that the model is widely applicable and one can use both the intuitions derived from this model and the analysis techniques to study specific situations of interest that might go beyond the literal definitions in the model when designing prediction (or other markets where participants directly influence outcomes. Interesting avenues for future work include generalizing our results to other MSRs investigating liquidation values other than the mean vote and broader investigation of the properties of subsidy mechanisms to achieve incentive compatibility in the combined game.
9 REFERENCES [] J. Abernethy Y. Chen and J. Wortman Vaughan. An optimization-based framework for automated market-making. In Proceedings of the th ACM conference on Electronic commerce pages ACM 0. [] J. D. Abernethy and R. M. Frongillo. A characterization of scoring rules for linear properties. Journal of Machine Learning Research-Proceedings Track 3:7 0. [3] J. Berg R. Forsythe F. Nelson and T. Rietz. Results from a dozen years of election futures markets research. Handbook Exp. Econ. Res. : [] J. E. Berg and T. A. Rietz. The Iowa Electronic Markets: Stylized facts and open issues. Information Markets: A New Way of Making Decisions edited by Robert W. Hahn and Paul C. Tetlock. AEI-Brookings Joint Center for Regulatory Studies pages [5] C. Boutilier. Eliciting forecasts from self-interested experts: scoring rules for decision makers. In Proceedings of the th International Conference on Autonomous Agents and Multiagent Systems-Volume pages International Foundation for Autonomous Agents and Multiagent Systems 0. [6] A. Brahma M. Chakraborty S. Das A. Lavoie and M. Magdon-Ismail. A Bayesian market maker. In Proceedings of ACM EC pages [7] M. Chakraborty S. Das A. Lavoie M. Magdon-Ismail and Y. Naamad. Instructor rating markets. In Auctions Market Mechanisms and Their Applications pages 3 3. Springer 0. [8] Y. Chen S. Dimitrov R. Sami D. Reeves D. Pennock R. Hanson L. Fortnow and R. Gonen. Gaming prediction markets: Equilibrium strategies with a market maker. Algorithmica pages [9] Y. Chen X. A. Gao R. Goldstein and I. A. Kash. Market manipulation with outside incentives. In Proc. AAAI 0. [0] Y. Chen I. A. Kash M. Ruberry and V. Shnayder. Decision markets with good incentives. In Proc. 7th Workshop on Internet and Network Economics pages [] Y. Chen and D. Pennock. A utility framework for bounded-loss market makers. In Proc. UAI pages [] B. Cowgill J. Wolfers and E. Zitzewitz. Using prediction markets to track information flows: Evidence from Google. Working paper 00. [3] S. Das. The effects of market-making on price dynamics. In Proc. AAMAS May 008. [] S. Dimitrov and R. Sami. Composition of markets with conflicting incentives. In Proc. ACM Conference on Electronic Commerce pages [5] F. D. Foster and S. Viswanathan. Strategic trading when agents forecast the forecasts of others. Journal of Finance 5: [6] L. R. Glosten and P. R. Milgrom. Bid ask and transaction prices in a specialist market with heterogeneously informed traders. Journal of Financial Economics : [7] R. Hanson. Decision markets. IEEE Intelligent Systems (3: [8] R. Hanson. Combinatorial information market design. Information Systems Frontiers 5(: [9] R. Hanson. Logarithmic market scoring rules for modular combinatorial information aggregation. J. Prediction Markets (: [0] R. Hanson. The policy analysis market (a thwarted experiment in the use of prediction markets for public policy. Innovations (3: [] R. Hanson and R. Oprea. A manipulator can aid prediction market accuracy. Economica 76(30: [] R. Hanson R. Oprea and D. Porter. Information aggregation and manipulation in an experimental market. J. Econ. Beh. and Org. 60: [3] C. W. Holden and A. Subrahmanyam. Long-lived private information and imperfect competition. Journal of Finance 7: [] E. H. Huang and Y. Shoham. Price manipulation in prediction markets: analysis and mitigation. In Proceedings of the 0 International Conference on Autonomous Agents and Multi-agent Systems pages 3 0. International Foundation for Autonomous Agents and Multiagent Systems 0. [5] A. S. Kyle. Continuous auctions and insider trading. Econometrica 53(6: [6] N. Miller P. Resnick and R. Zeckhauser. Eliciting Informative Feedback: The Peer-Prediction Method. Management Science 5(9: Sept [7] M. Ostrovsky. Information aggregation in dynamic markets with strategic traders. Econometrica 80(6: [8] A. Othman and T. Sandholm. Decision rules and decision markets. In Proc. AAMAS pages [9] D. Prelec. A Bayesian Truth Serum for subjective data. Science 306(5695: [30] D. Prelec and H. Seung. An algorithm that finds truth even if most people are wrong. Working Paper 007. [3] P. W. Rhode and K. S. Strumpf. Manipulating political stock markets: A field experiment and a century of observational data. University of Arizona mimeo 006. [3] D. M. Rothschild and R. Sethi. Trading strategies and market microstructure: Evidence from a prediction market. Available at SSRN [33] P. Shi V. Conitzer and M. Guo. Prediction mechanisms that do not incentivize undesirable actions. In Proc. 5th Workshop on Internet and Network Economics 009. [3] J. Stiglitz. Terrorism: There s no futures in it. Los Angeles Times July [35] B. Waggoner and Y. Chen. Information elicitation sans verification. In Proceedings of the 3rd Workshop on Social Computing and User Generated Content (SC3 03. [36] R. Weaver and D. Prelec. Creating truthtelling incentives with the Bayesian Truth Serum. Journal of Marketing Research pages [37] J. Witkowski and D. Parkes. A robust Bayesian Truth
10 Serum for small populations. In Proc. AAAI 0. [38] J. Witkowski and D. C. Parkes. Peer prediction without a common prior. In Proc. ACM Conference on Electronic Commerce 0. [39] J. Wolfers and E. Zitzewitz. Prediction markets. J. Econ. Perspectives 8(:
Trading On A Rigged Game: Outcome Manipulation In Prediction Markets
Trading On A Rigged Game: Outcome Manipulation In Prediction Markets Mithun Chakraborty, Sanmay Das Washington University in St. Louis {mithunchakraborty,sanmay}@wustl.edu Abstract Prediction markets are
More informationDecision Markets With Good Incentives
Decision Markets With Good Incentives Yiling Chen, Ian Kash, Mike Ruberry and Victor Shnayder Harvard University Abstract. Decision and prediction markets are designed to determine the likelihood of future
More informationDecision Markets with Good Incentives
Decision Markets with Good Incentives The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Chen, Yiling, Ian Kash, Mike Ruberry,
More informationDecision Markets With Good Incentives
Decision Markets With Good Incentives Yiling Chen, Ian Kash, Mike Ruberry and Victor Shnayder Harvard University Abstract. Decision markets both predict and decide the future. They allow experts to predict
More informationMarket Manipulation with Outside Incentives
Market Manipulation with Outside Incentives Yiling Chen Harvard SEAS yiling@eecs.harvard.edu Xi Alice Gao Harvard SEAS xagao@seas.harvard.edu Rick Goldstein Harvard SEAS rgoldst@fas.harvard.edu Ian A.
More informationA Multi-Agent Prediction Market based on Partially Observable Stochastic Game
based on Partially C-MANTIC Research Group Computer Science Department University of Nebraska at Omaha, USA ICEC 2011 1 / 37 Problem: Traders behavior in a prediction market and its impact on the prediction
More informationGaming Dynamic Parimutuel Markets
Gaming Dynamic Parimutuel Markets Qianya Lin 1, and Yiling Chen 1 City University of Hong Kong, Hong Kong SAR Harvard University, Cambridge, MA, USA Abstract. We study the strategic behavior of risk-neutral
More informationWhat You Jointly Know Determines How You Act: Strategic Interactions in Prediction Markets
What You Jointly Know Determines How You Act: Strategic Interactions in Prediction Markets The Harvard community has made this article openly available. Please share how this access benefits you. Your
More informationInformation Aggregation in Dynamic Markets with Strategic Traders. Michael Ostrovsky
Information Aggregation in Dynamic Markets with Strategic Traders Michael Ostrovsky Setup n risk-neutral players, i = 1,..., n Finite set of states of the world Ω Random variable ( security ) X : Ω R Each
More informationOn Existence of Equilibria. Bayesian Allocation-Mechanisms
On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine
More informationWhat You Jointly Know Determines How You Act Strategic Interactions in Prediction Markets
What You Jointly Know Determines How You Act Strategic Interactions in Prediction Markets XI ALICE GAO, Harvard University JIE ZHANG, Aarhus University YILING CHEN, Harvard University The primary goal
More informationTwo-Dimensional Bayesian Persuasion
Two-Dimensional Bayesian Persuasion Davit Khantadze September 30, 017 Abstract We are interested in optimal signals for the sender when the decision maker (receiver) has to make two separate decisions.
More informationMarket manipulation with outside incentives
DOI 10.1007/s10458-014-9249-1 Market manipulation with outside incentives Yiling Chen Xi Alice Gao Rick Goldstein Ian A. Kash The Author(s) 2014 Abstract Much evidence has shown that prediction markets
More informationEvaluating Strategic Forecasters. Rahul Deb with Mallesh Pai (Rice) and Maher Said (NYU Stern) Becker Friedman Theory Conference III July 22, 2017
Evaluating Strategic Forecasters Rahul Deb with Mallesh Pai (Rice) and Maher Said (NYU Stern) Becker Friedman Theory Conference III July 22, 2017 Motivation Forecasters are sought after in a variety of
More informationComparing Allocations under Asymmetric Information: Coase Theorem Revisited
Comparing Allocations under Asymmetric Information: Coase Theorem Revisited Shingo Ishiguro Graduate School of Economics, Osaka University 1-7 Machikaneyama, Toyonaka, Osaka 560-0043, Japan August 2002
More informationAuditing in the Presence of Outside Sources of Information
Journal of Accounting Research Vol. 39 No. 3 December 2001 Printed in U.S.A. Auditing in the Presence of Outside Sources of Information MARK BAGNOLI, MARK PENNO, AND SUSAN G. WATTS Received 29 December
More informationBid-Ask Spreads and Volume: The Role of Trade Timing
Bid-Ask Spreads and Volume: The Role of Trade Timing Toronto, Northern Finance 2007 Andreas Park University of Toronto October 3, 2007 Andreas Park (UofT) The Timing of Trades October 3, 2007 1 / 25 Patterns
More informationTopics in Game Theory - Prediction Markets
Topics in Game Theory - Prediction Markets A Presentation PhD Student: Rohith D Vallam Faculty Advisor: Prof Y. Narahari Department of Computer Science & Automation Indian Institute of Science, Bangalore
More informationISSN BWPEF Uninformative Equilibrium in Uniform Price Auctions. Arup Daripa Birkbeck, University of London.
ISSN 1745-8587 Birkbeck Working Papers in Economics & Finance School of Economics, Mathematics and Statistics BWPEF 0701 Uninformative Equilibrium in Uniform Price Auctions Arup Daripa Birkbeck, University
More informationFeedback Effect and Capital Structure
Feedback Effect and Capital Structure Minh Vo Metropolitan State University Abstract This paper develops a model of financing with informational feedback effect that jointly determines a firm s capital
More informationPrice Evolution in a Continuous Double Auction Prediction Market with a Scoring-Rule Based Market Maker
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Price Evolution in a Continuous Double Auction Prediction Market with a Scoring-Rule Based Market Maker Mithun Chakraborty, Sanmay
More informationGaming Prediction Markets: Equilibrium Strategies with a Market Maker
Gaming Prediction Markets: Equilibrium Strategies with a Market Maker The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation
More informationMechanism Design and Auctions
Multiagent Systems (BE4M36MAS) Mechanism Design and Auctions Branislav Bošanský and Michal Pěchouček Artificial Intelligence Center, Department of Computer Science, Faculty of Electrical Engineering, Czech
More informationMicroeconomic Theory II Preliminary Examination Solutions
Microeconomic Theory II Preliminary Examination Solutions 1. (45 points) Consider the following normal form game played by Bruce and Sheila: L Sheila R T 1, 0 3, 3 Bruce M 1, x 0, 0 B 0, 0 4, 1 (a) Suppose
More informationChapter 3. Dynamic discrete games and auctions: an introduction
Chapter 3. Dynamic discrete games and auctions: an introduction Joan Llull Structural Micro. IDEA PhD Program I. Dynamic Discrete Games with Imperfect Information A. Motivating example: firm entry and
More informationMeasuring the Amount of Asymmetric Information in the Foreign Exchange Market
Measuring the Amount of Asymmetric Information in the Foreign Exchange Market Esen Onur 1 and Ufuk Devrim Demirel 2 September 2009 VERY PRELIMINARY & INCOMPLETE PLEASE DO NOT CITE WITHOUT AUTHORS PERMISSION
More informationMartingale Pricing Theory in Discrete-Time and Discrete-Space Models
IEOR E4707: Foundations of Financial Engineering c 206 by Martin Haugh Martingale Pricing Theory in Discrete-Time and Discrete-Space Models These notes develop the theory of martingale pricing in a discrete-time,
More informationSignaling Games. Farhad Ghassemi
Signaling Games Farhad Ghassemi Abstract - We give an overview of signaling games and their relevant solution concept, perfect Bayesian equilibrium. We introduce an example of signaling games and analyze
More informationEliciting Informative Feedback: The Peer-Prediction Method
Eliciting Informative Feedback: The Peer-Prediction Method Nolan Miller, Paul Resnick, & Richard Zeckhauser Thomas Steinke & David Rezza Baqaee Contents Problem and Setup Initial Game Extensions Further
More informationInformation aggregation for timing decision making.
MPRA Munich Personal RePEc Archive Information aggregation for timing decision making. Esteban Colla De-Robertis Universidad Panamericana - Campus México, Escuela de Ciencias Económicas y Empresariales
More informationSocially-Optimal Design of Crowdsourcing Platforms with Reputation Update Errors
Socially-Optimal Design of Crowdsourcing Platforms with Reputation Update Errors 1 Yuanzhang Xiao, Yu Zhang, and Mihaela van der Schaar Abstract Crowdsourcing systems (e.g. Yahoo! Answers and Amazon Mechanical
More informationFinish what s been left... CS286r Fall 08 Finish what s been left... 1
Finish what s been left... CS286r Fall 08 Finish what s been left... 1 Perfect Bayesian Equilibrium A strategy-belief pair, (σ, µ) is a perfect Bayesian equilibrium if (Beliefs) At every information set
More informationLecture 5: Iterative Combinatorial Auctions
COMS 6998-3: Algorithmic Game Theory October 6, 2008 Lecture 5: Iterative Combinatorial Auctions Lecturer: Sébastien Lahaie Scribe: Sébastien Lahaie In this lecture we examine a procedure that generalizes
More informationEssays on Some Combinatorial Optimization Problems with Interval Data
Essays on Some Combinatorial Optimization Problems with Interval Data a thesis submitted to the department of industrial engineering and the institute of engineering and sciences of bilkent university
More informationEcon 8602, Fall 2017 Homework 2
Econ 8602, Fall 2017 Homework 2 Due Tues Oct 3. Question 1 Consider the following model of entry. There are two firms. There are two entry scenarios in each period. With probability only one firm is able
More informationAll Equilibrium Revenues in Buy Price Auctions
All Equilibrium Revenues in Buy Price Auctions Yusuke Inami Graduate School of Economics, Kyoto University This version: January 009 Abstract This note considers second-price, sealed-bid auctions with
More informationUnraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets
Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Nathaniel Hendren October, 2013 Abstract Both Akerlof (1970) and Rothschild and Stiglitz (1976) show that
More informationAuctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University
Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2015 - Lecture 12 Where are We? Agent architectures (inc. BDI
More informationCompeting Mechanisms with Limited Commitment
Competing Mechanisms with Limited Commitment Suehyun Kwon CESIFO WORKING PAPER NO. 6280 CATEGORY 12: EMPIRICAL AND THEORETICAL METHODS DECEMBER 2016 An electronic version of the paper may be downloaded
More informationPh.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017
Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.
More informationRevenue Equivalence and Income Taxation
Journal of Economics and Finance Volume 24 Number 1 Spring 2000 Pages 56-63 Revenue Equivalence and Income Taxation Veronika Grimm and Ulrich Schmidt* Abstract This paper considers the classical independent
More informationA lower bound on seller revenue in single buyer monopoly auctions
A lower bound on seller revenue in single buyer monopoly auctions Omer Tamuz October 7, 213 Abstract We consider a monopoly seller who optimally auctions a single object to a single potential buyer, with
More informationKIER DISCUSSION PAPER SERIES
KIER DISCUSSION PAPER SERIES KYOTO INSTITUTE OF ECONOMIC RESEARCH http://www.kier.kyoto-u.ac.jp/index.html Discussion Paper No. 657 The Buy Price in Auctions with Discrete Type Distributions Yusuke Inami
More informationCharacterization of the Optimum
ECO 317 Economics of Uncertainty Fall Term 2009 Notes for lectures 5. Portfolio Allocation with One Riskless, One Risky Asset Characterization of the Optimum Consider a risk-averse, expected-utility-maximizing
More informationAn Axiomatic Characterization of Continuous-Outcome Market Makers
An Axiomatic Characterization of Continuous-Outcome Market Makers Xi Alice Gao and Yiling Chen School or Engineering and Applied Sciences Harvard University Cambridge, MA 02138 {xagao,yiling}@eecs.harvard.edu
More informationPAULI MURTO, ANDREY ZHUKOV
GAME THEORY SOLUTION SET 1 WINTER 018 PAULI MURTO, ANDREY ZHUKOV Introduction For suggested solution to problem 4, last year s suggested solutions by Tsz-Ning Wong were used who I think used suggested
More informationAmbiguous Information and Trading Volume in stock market
Ambiguous Information and Trading Volume in stock market Meng-Wei Chen Department of Economics, Indiana University at Bloomington April 21, 2011 Abstract This paper studies the information transmission
More informationImpact of Imperfect Information on the Optimal Exercise Strategy for Warrants
Impact of Imperfect Information on the Optimal Exercise Strategy for Warrants April 2008 Abstract In this paper, we determine the optimal exercise strategy for corporate warrants if investors suffer from
More informationComputational Aspects of Prediction Markets
Computational Aspects of Prediction Markets David M. Pennock, Yahoo! Research Yiling Chen, Lance Fortnow, Joe Kilian, Evdokia Nikolova, Rahul Sami, Michael Wellman Mech Design for Prediction Q: Will there
More informationAuctions That Implement Efficient Investments
Auctions That Implement Efficient Investments Kentaro Tomoeda October 31, 215 Abstract This article analyzes the implementability of efficient investments for two commonly used mechanisms in single-item
More informationRevenue optimization in AdExchange against strategic advertisers
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
More informationMarch 30, Why do economists (and increasingly, engineers and computer scientists) study auctions?
March 3, 215 Steven A. Matthews, A Technical Primer on Auction Theory I: Independent Private Values, Northwestern University CMSEMS Discussion Paper No. 196, May, 1995. This paper is posted on the course
More informationMicroeconomics II. CIDE, MsC Economics. List of Problems
Microeconomics II CIDE, MsC Economics List of Problems 1. There are three people, Amy (A), Bart (B) and Chris (C): A and B have hats. These three people are arranged in a room so that B can see everything
More informationApproximate Revenue Maximization with Multiple Items
Approximate Revenue Maximization with Multiple Items Nir Shabbat - 05305311 December 5, 2012 Introduction The paper I read is called Approximate Revenue Maximization with Multiple Items by Sergiu Hart
More informationEfficiency and Herd Behavior in a Signalling Market. Jeffrey Gao
Efficiency and Herd Behavior in a Signalling Market Jeffrey Gao ABSTRACT This paper extends a model of herd behavior developed by Bikhchandani and Sharma (000) to establish conditions for varying levels
More informationEfficiency in Decentralized Markets with Aggregate Uncertainty
Efficiency in Decentralized Markets with Aggregate Uncertainty Braz Camargo Dino Gerardi Lucas Maestri December 2015 Abstract We study efficiency in decentralized markets with aggregate uncertainty and
More informationAuctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University
Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2014 - Lecture 12 Where are We? Agent architectures (inc. BDI
More informationYao s Minimax Principle
Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,
More informationMA300.2 Game Theory 2005, LSE
MA300.2 Game Theory 2005, LSE Answers to Problem Set 2 [1] (a) This is standard (we have even done it in class). The one-shot Cournot outputs can be computed to be A/3, while the payoff to each firm can
More informationApril 29, X ( ) for all. Using to denote a true type and areport,let
April 29, 2015 "A Characterization of Efficient, Bayesian Incentive Compatible Mechanisms," by S. R. Williams. Economic Theory 14, 155-180 (1999). AcommonresultinBayesianmechanismdesignshowsthatexpostefficiency
More informationAn Ascending Double Auction
An Ascending Double Auction Michael Peters and Sergei Severinov First Version: March 1 2003, This version: January 20 2006 Abstract We show why the failure of the affiliation assumption prevents the double
More informationGathering Information before Signing a Contract: a New Perspective
Gathering Information before Signing a Contract: a New Perspective Olivier Compte and Philippe Jehiel November 2003 Abstract A principal has to choose among several agents to fulfill a task and then provide
More informationFDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.
FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.) Hints for Problem Set 2 1. Consider a zero-sum game, where
More informationPareto Efficient Allocations with Collateral in Double Auctions (Working Paper)
Pareto Efficient Allocations with Collateral in Double Auctions (Working Paper) Hans-Joachim Vollbrecht November 12, 2015 The general conditions are studied on which Continuous Double Auctions (CDA) for
More informationImportance Sampling for Fair Policy Selection
Importance Sampling for Fair Policy Selection Shayan Doroudi Carnegie Mellon University Pittsburgh, PA 15213 shayand@cs.cmu.edu Philip S. Thomas Carnegie Mellon University Pittsburgh, PA 15213 philipt@cs.cmu.edu
More informationAlternative sources of information-based trade
no trade theorems [ABSTRACT No trade theorems represent a class of results showing that, under certain conditions, trade in asset markets between rational agents cannot be explained on the basis of differences
More informationRecap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1
Auction Theory II Lecture 19 Auction Theory II Lecture 19, Slide 1 Lecture Overview 1 Recap 2 First-Price Auctions 3 Revenue Equivalence 4 Optimal Auctions Auction Theory II Lecture 19, Slide 2 Motivation
More informationSupplementary Material for: Belief Updating in Sequential Games of Two-Sided Incomplete Information: An Experimental Study of a Crisis Bargaining
Supplementary Material for: Belief Updating in Sequential Games of Two-Sided Incomplete Information: An Experimental Study of a Crisis Bargaining Model September 30, 2010 1 Overview In these supplementary
More informationAn Approximation Algorithm for Capacity Allocation over a Single Flight Leg with Fare-Locking
An Approximation Algorithm for Capacity Allocation over a Single Flight Leg with Fare-Locking Mika Sumida School of Operations Research and Information Engineering, Cornell University, Ithaca, New York
More informationThe Duo-Item Bisection Auction
Comput Econ DOI 10.1007/s10614-013-9380-0 Albin Erlanson Accepted: 2 May 2013 Springer Science+Business Media New York 2013 Abstract This paper proposes an iterative sealed-bid auction for selling multiple
More informationUC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016
UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016 More on strategic games and extensive games with perfect information Block 2 Jun 11, 2017 Auctions results Histogram of
More informationADVERSE SELECTION PAPER 8: CREDIT AND MICROFINANCE. 1. Introduction
PAPER 8: CREDIT AND MICROFINANCE LECTURE 2 LECTURER: DR. KUMAR ANIKET Abstract. We explore adverse selection models in the microfinance literature. The traditional market failure of under and over investment
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 22 COOPERATIVE GAME THEORY Correlated Strategies and Correlated
More informationIn Diamond-Dybvig, we see run equilibria in the optimal simple contract.
Ennis and Keister, "Run equilibria in the Green-Lin model of financial intermediation" Journal of Economic Theory 2009 In Diamond-Dybvig, we see run equilibria in the optimal simple contract. When the
More informationA Decentralized Learning Equilibrium
Paper to be presented at the DRUID Society Conference 2014, CBS, Copenhagen, June 16-18 A Decentralized Learning Equilibrium Andreas Blume University of Arizona Economics ablume@email.arizona.edu April
More informationGame Theory Fall 2003
Game Theory Fall 2003 Problem Set 5 [1] Consider an infinitely repeated game with a finite number of actions for each player and a common discount factor δ. Prove that if δ is close enough to zero then
More informationResearch Article A Mathematical Model of Communication with Reputational Concerns
Discrete Dynamics in Nature and Society Volume 06, Article ID 650704, 6 pages http://dx.doi.org/0.55/06/650704 Research Article A Mathematical Model of Communication with Reputational Concerns Ce Huang,
More informationMicroeconomics Qualifying Exam
Summer 2018 Microeconomics Qualifying Exam There are 100 points possible on this exam, 50 points each for Prof. Lozada s questions and Prof. Dugar s questions. Each professor asks you to do two long questions
More informationCS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games
CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games Tim Roughgarden November 6, 013 1 Canonical POA Proofs In Lecture 1 we proved that the price of anarchy (POA)
More informationAn Axiomatic Study of Scoring Rule Markets. January 2018
An Axiomatic Study of Scoring Rule Markets Rafael Frongillo Bo Waggoner CU Boulder UPenn January 2018 1 / 21 Prediction markets Prediction market: mechanism wherein agents buy/sell contracts... thereby
More informationOUTCOME MANIPULATION IN CORPORATE PREDICTION MARKETS
OUTCOME MANIPULATION IN CORPORATE PREDICTION MARKETS Marco Ottaviani London Business School Peter Norman Sørensen University of Copenhagen Abstract This paper presents a framework for applying prediction
More information1 Appendix A: Definition of equilibrium
Online Appendix to Partnerships versus Corporations: Moral Hazard, Sorting and Ownership Structure Ayca Kaya and Galina Vereshchagina Appendix A formally defines an equilibrium in our model, Appendix B
More informationLiquidity and Asset Prices in Rational Expectations Equilibrium with Ambiguous Information
Liquidity and Asset Prices in Rational Expectations Equilibrium with Ambiguous Information Han Ozsoylev SBS, University of Oxford Jan Werner University of Minnesota September 006, revised March 007 Abstract:
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 4: Single-Period Market Models 1 / 87 General Single-Period
More informationAsymmetric Information: Walrasian Equilibria, and Rational Expectations Equilibria
Asymmetric Information: Walrasian Equilibria and Rational Expectations Equilibria 1 Basic Setup Two periods: 0 and 1 One riskless asset with interest rate r One risky asset which pays a normally distributed
More informationStrategic Trading of Informed Trader with Monopoly on Shortand Long-Lived Information
ANNALS OF ECONOMICS AND FINANCE 10-, 351 365 (009) Strategic Trading of Informed Trader with Monopoly on Shortand Long-Lived Information Chanwoo Noh Department of Mathematics, Pohang University of Science
More informationMechanism Design for Multi-Agent Meeting Scheduling Including Time Preferences, Availability, and Value of Presence
Mechanism Design for Multi-Agent Meeting Scheduling Including Time Preferences, Availability, and Value of Presence Elisabeth Crawford and Manuela Veloso Computer Science Department, Carnegie Mellon University,
More informationMonetizing Data Through B2B Negotiation: When is a Demonstration Appropriate?
Monetizing Data Through B2B Negotiation: When is a Demonstration Appropriate? Abstract The explosive growth of ebusiness has allowed many companies to accumulate a repertoire of rich and unique datasets
More informationMechanism Design and Auctions
Mechanism Design and Auctions Game Theory Algorithmic Game Theory 1 TOC Mechanism Design Basics Myerson s Lemma Revenue-Maximizing Auctions Near-Optimal Auctions Multi-Parameter Mechanism Design and the
More informationSequential Financial Market Trading: The Role of Endogenous Timing
Sequential Financial Market Trading: The Role of Endogenous Timing Andreas Park University of Toronto July 2004 Abstract The paper analyses a simplified version of a Glosten-Milgrom style specialist security
More informationAn Optimization-Based Framework for Combinatorial Prediction Market Design
An Optimization-Based Framework for Combinatorial Prediction Market Design Jacob Abernethy UC Berkeley jake@cs.berkeley.edu Yiling Chen Harvard University yiling@eecs.harvard.edu Jennifer Wortman Vaughan
More informationLectures on Trading with Information Competitive Noisy Rational Expectations Equilibrium (Grossman and Stiglitz AER (1980))
Lectures on Trading with Information Competitive Noisy Rational Expectations Equilibrium (Grossman and Stiglitz AER (980)) Assumptions (A) Two Assets: Trading in the asset market involves a risky asset
More informationMicroeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017
Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 017 1. Sheila moves first and chooses either H or L. Bruce receives a signal, h or l, about Sheila s behavior. The distribution
More informationStochastic Games and Bayesian Games
Stochastic Games and Bayesian Games CPSC 532l Lecture 10 Stochastic Games and Bayesian Games CPSC 532l Lecture 10, Slide 1 Lecture Overview 1 Recap 2 Stochastic Games 3 Bayesian Games 4 Analyzing Bayesian
More informationThe Cascade Auction A Mechanism For Deterring Collusion In Auctions
The Cascade Auction A Mechanism For Deterring Collusion In Auctions Uriel Feige Weizmann Institute Gil Kalai Hebrew University and Microsoft Research Moshe Tennenholtz Technion and Microsoft Research Abstract
More information1 Rational Expectations Equilibrium
1 Rational Expectations Euilibrium S - the (finite) set of states of the world - also use S to denote the number m - number of consumers K- number of physical commodities each trader has an endowment vector
More informationFinancial Economics Field Exam August 2011
Financial Economics Field Exam August 2011 There are two questions on the exam, representing Macroeconomic Finance (234A) and Corporate Finance (234C). Please answer both questions to the best of your
More informationAntino Kim Kelley School of Business, Indiana University, Bloomington Bloomington, IN 47405, U.S.A.
THE INVISIBLE HAND OF PIRACY: AN ECONOMIC ANALYSIS OF THE INFORMATION-GOODS SUPPLY CHAIN Antino Kim Kelley School of Business, Indiana University, Bloomington Bloomington, IN 47405, U.S.A. {antino@iu.edu}
More informationA NOTE ON SANDRONI-SHMAYA BELIEF ELICITATION MECHANISM
The Journal of Prediction Markets 2016 Vol 10 No 2 pp 14-21 ABSTRACT A NOTE ON SANDRONI-SHMAYA BELIEF ELICITATION MECHANISM Arthur Carvalho Farmer School of Business, Miami University Oxford, OH, USA,
More informationMicroeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 2017
Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 07. (40 points) Consider a Cournot duopoly. The market price is given by q q, where q and q are the quantities of output produced
More information