TY - GEN

T1 - Parimutuel betting on permutations

AU - Agrawal, Shipra

AU - Wang, Zizhuo

AU - Ye, Yinyu

PY - 2008

Y1 - 2008

N2 - We focus on a permutation betting market under parimutuel call auction model where traders bet on final rankings of n candidates. We present a Proportional Betting mechanism for this market. Our mechanism allows traders to bet on any subset of the n 2 'candidate-rank' pairs, and rewards them proportionally to the number of pairs that appear in the final outcome. We show that market organizer's decision problem for this mechanism can be formulated as a convex program of polynomial size. Further, the formulation yields a set of n 2 unique marginal prices that are sufficient to price the bets in this mechanism, and are computable in polynomial-time. These marginal prices reflect the traders' beliefs about the marginal distributions over outcomes. More importantly, we propose techniques to compute the joint distribution over n! permutations from these marginal distributions. We show that using a maximum entropy criterion, we can obtain a concise parametric form (with only n 2 parameters) for the joint distribution which is defined over an exponentially large state space. We then present an approximation algorithm for computing the parameters of this distribution. In fact, our algorithm addresses a generic problem of finding the maximum entropy distribution over permutations that has a given mean, and is of independent interest.

AB - We focus on a permutation betting market under parimutuel call auction model where traders bet on final rankings of n candidates. We present a Proportional Betting mechanism for this market. Our mechanism allows traders to bet on any subset of the n 2 'candidate-rank' pairs, and rewards them proportionally to the number of pairs that appear in the final outcome. We show that market organizer's decision problem for this mechanism can be formulated as a convex program of polynomial size. Further, the formulation yields a set of n 2 unique marginal prices that are sufficient to price the bets in this mechanism, and are computable in polynomial-time. These marginal prices reflect the traders' beliefs about the marginal distributions over outcomes. More importantly, we propose techniques to compute the joint distribution over n! permutations from these marginal distributions. We show that using a maximum entropy criterion, we can obtain a concise parametric form (with only n 2 parameters) for the joint distribution which is defined over an exponentially large state space. We then present an approximation algorithm for computing the parameters of this distribution. In fact, our algorithm addresses a generic problem of finding the maximum entropy distribution over permutations that has a given mean, and is of independent interest.

UR - http://www.scopus.com/inward/record.url?scp=58849087140&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58849087140&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-92185-1_21

DO - 10.1007/978-3-540-92185-1_21

M3 - Conference contribution

AN - SCOPUS:58849087140

SN - 3540921842

SN - 9783540921844

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 126

EP - 137

BT - Internet and Network Economics - 4th International Workshop, WINE 2008, Proceedings

T2 - 4th International Workshop on Internet and Network Economics, WINE 2008

Y2 - 17 December 2008 through 20 December 2008

ER -