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...

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 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...

Many employers adopt practices that insulate their workforces from the outside labor market. One defining characteristic of such an "internal labor market" is a company wage policy that diverges from that of the external market. These divergences may occur for an entire employer on average, or...

In order to model the subjective uncertainty of a player over the behavior strategies of an opponent, one must consider the player's beliefs about the opponent's play at information sets that the player thinks have probability zero. This corregendum uses “trembles†to provide a...