I develop a new mechanism for risk allocation and information speculation called a dynamic pari-mutuel market (DPM). A DPM acts as hybrid between a pari-mutuel market and a continuous double auction (CDA), inheriting some of the advantages of both. Like a pari-mutuel market, a DPM offers infinite buy-in liquidity and zero risk for the market institution; like a CDA, a DPM can continuously react to new information, dynamically incorporate information into prices, and allow traders to lock in gains or limit losses by selling prior to event resolution. The trader interface can be designed to mimic the familiar double auction format with bid-ask queues, though with an addition variable called the payoff per share. The DPM price function can be viewed as an automated market maker always offering to sell at some price, and moving the price appropriately according to demand. Since the mechanism is pari-mutuel (i.e., redistributive), it is guaranteed to pay out exactly the amount of money taken in. I explore a number of variations on the basic DPM, analyzing the properties of each, and solving in closed form for their respective price functions.

We analyze data from $52$ online in-game sports betting markets (where betting is allowed continuously throughout a game), including 34 markets based on soccer (European football) games from the 2002 World Cup, and 18 basketball games from the 2002 USA National Basketball Association (NBA) championship. We show that prices on average approach the correct outcome over time, and the price dynamics in the markets are closely coupled with game events, agreeing with efficient market assumptions. We also examine qualitative distinctions between the two types of games.

We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying or selling securities -- which can be thought of as betting on or against a particular future outcome -- allows agents both to hedge risk and to profit (in expectation) on subjective predictions. A compound securities market allows agents to place bets on arbitrary boolean combinations of events, enabling them to more closely achieve their optimal risk exposure, and enabling the market as a whole to more closely achieve the social optimum. The tradeoff for allowing such expressivity is in the complexity of the agents' and auctioneer's optimization problems.

According to economic theory, supported by empirical and laboratory evidence, the equilibrium price of a financial security reflects all of the information regarding the security's value. We investigate the dynamics of the computational process on the path toward equilibrium, where information distributed among traders is revealed stepby -step over time and incorporated into the market price. We develop a simplified model of an information market, along with trading strategies, in order to formalize the computational properties of the process. We show that securities whose payoffs cannot be expressed as a weighted threshold function of distributed input bits are not guaranteed to converge to the proper equilibrium predicted by economic theory. On the other hand, securities whose payoffs are threshold functions are guaranteed to converge, for all prior probability distributions. Moreover, these threshold securities converge in at most n rounds, where n is the number of bits of distributed information. We also prove a lower bound, showing a type of threshold security that requires at least n/2 rounds to converge in the worst case.

This paper studies how software agents influence the market behavior of human traders. Software agents with a passive arbitrage seeking strategy are introduced in a double auction market experiment with human subjects in the laboratory. As a treatment variable, the influence of information on the existence of software agents is investigated. We found that common knowledge about the presence of software agents triggers more efficient market prices when the programmed strategy was employed whereas an effect of the information condition on behavioral variables could not be observed. Surprisingly, the introduction of software agents results in lower market efficiency in the no information treatment when compared to the baseline treatment without software agents.

Citing recent successes in forecasting elections, movies, products, and other outcomes, prediction market advocates call for widespread use of market-based methods for government and corporate decision making. Though theoretical and empirical evidence suggests that markets do often outperform alternative mechanisms, less attention has been paid to the magnitude of improvement. Here we compare the performance of prediction markets to conventional methods of prediction, namely polls and statistical models. Examining thousands of sporting and movie events, we find that the relative advantage of prediction markets is surprisingly small, as measured by squared error, calibration, and discrimination. Moreover, these domains also exhibit remarkably steep diminishing returns to information, with nearly all the predictive power captured by only two or three parameters. As policy makers consider adoption of prediction markets, costs should be weighed against potentially modest benefits.

In this paper a simulation is presented, where programmed traders compete on a market implemented by a double auction market institution. To this end, we added a XML-interface to an Iowa-style asset market system and implemented a collection of programmed traders with pure and simple strategies. The implementation and the simple simulation presented in this paper represent the starting point to investigate whether software agents change the strategies of human subjects in a follow-up study. Categories and Subject Descriptors: J.7 [Computer Applications]: Computer in other Systems

We have analyzed the impact of agents and their trading strategies on an experimental asset market. To this end, we added an XML-interface to an existing electronic market and implemented artificial agents which acted as elements of disturbance in the trading process. These artificial traders applied simple and constant strategies which may sometimes appear to be "rational" or random to the eyes of other traders. We then recorded the reaction of the electronic market.

We propose a model of prediction markets where participants are biased according to their social relationships. We relax the standard assumption of complete rationality and adopt an arguably more realistic model where agents are disproportionally influenced by their neighbors in a social network. We conduct extensive agent-based simulations of our model. We find that prices in prediction markets remain accurate even when participants are biased and irrational. Moreover, accuracy is robust to changes in many factors, including how individuals are motivated to participate in the market, the way that individuals use public information, individual utility functions, the topology of the social network, and the strength of social influences. Our model can explain the high volume of trade often observed in speculative markets that is hard or impossible to explain under standard market rationality assumptions. Our model can also explain the documented ability of prediction markets to succeed even in the face of biased and irrational participants.

We analyze data from 52 online in-game sports betting markets (where betting is allowed continuously throughout a game), including 34 markets based on soccer (European football) games from the 2002 World Cup, and 18 basketball games from the 2002 USA National Basketball Association (NBA) championship. We show that prices on average approach the correct outcome over time, and the price dynamics in the markets are closely coupled with game events, agreeing with efficient market assumptions. We also examine qualitative distinctions between the two types of games.