Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is \scr{N}\scr{P}-complete and inapproximable. We present CABOB, a sophisticated optimal search algorithm for the problem. It uses decomposition...

The Gates Hillman prediction market (GHPM) was an internet prediction market designed to predict the opening day of the Gates and Hillman Centers, the new computer science complex at Carnegie Mellon University. Unlike a traditional continuous double auction format, the GHPM was mediated by an...

We provide a single reduction that demonstrates that in normal-form games: (1) it is -complete to determine whether Nash equilibria with certain natural properties exist (these results are similar to those obtained by Gilboa and Zemel [Gilboa, I., Zemel, E., 1989. Nash and correlated equilibria:...

The introduction of artificially intelligent algorithms in pricing decisions by firms has triggered a literature in industrial organization asking if the use of these algorithms will lead to collusive outcomes. In a simple repeated game environment it is shown that if algorithms can be reliably...