Peter R. Wurman

Learn More
Market mechanisms, such as auctions, will likely rep resent a common interaction medium for agents on the Internet. The Michigan Internet AuctionBot is a flexible, scalable, and robust auction server that supports both software and human agents. The server manages many aimultancous auctions by separating the interface from the core auction procedures. This(More)
Decentralized scheduling is the problem of allocating resources to alternative possible uses over time, where competing uses are represented by autonomous agents. Market mechanisms use prices derived through distributed bidding protocols to determine schedules. We investigate the existence of equilibrium prices for some general classes of scheduling(More)
We present an extensive breakdown of the auction design space that captures the essential similarities and differences of many auction mechanisms in a format more descriptive and useful than simple taxonomies. This parametrization serves as an organizational framework in which to classify work within the field, and uncoversparameter combinations(More)
Trading in electronic markets is a topic of increasing interest within the artificial intelligence (AI) and electronic commerce research communities. As Internet marketplaces proliferate, programs that monitor and bid in these markets automatically—what we call “trading agents”—will play a significant role. Various AI research communities have held(More)
We consider a general family of auction mechanisms that admit multiple buyers and sellers, and determine market-clearing prices. We analyze the economic incentives facing participants in such auctions, demonstrating that, under some conditions, it is possible to induce truthful revelation of values by buyers or sellers, but not both, and for singlebut not(More)
The 2001 Trading Agent Competition was the second in a series of events aiming to shed light on research issues in automating trading strategies. Based on a challenging market scenario in the domain of travel shopping, the competition presents agents with difficult issues in bidding strategy, market prediction, and resource allocation. Entrants in 2001(More)
We present a new method for computing pure strategy Nash equilibria for a class of <i>n</i>-person games where it is computationally expensive to compute the payoffs of the players as a result of the joint actions. Previous algorithms to compute Nash equilibria are based on mathematical programming and analytical derivation, and require a complete payoff(More)
are turned upside down by innovations. The years of research on robotics and multiagent systems are coming together to provide just such a disruption to the material-handling industry. While autonomous guided vehicles (AGVs) have been used to move material within warehouses since the 1950s, they have been used primarily to transport very large, very heavy(More)