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

[fre] L'article examine différentes théories concernant la nature d'une économie monétaire, en insistant sur la différence spécifique associée à la monnaie comme unité de valeur. Les rôles de la monnaie et de la circulation financière sont considérés et l'on évalue la différence...

We show that the use of communications to coordinate equilibria generates a Nash-threats folk theorem in two-player games with “almost public†information. The results generalize to the <i>n</i>-person case. However, the two-person case is more difficult because it is not possible to sustain...

Forecasts are said to be calibrated if the frequency predictions are approximately correct. This is a refinement of an idea first introduced by David Blackwell in 1955. We show that “<i>K</i>-initialized myopic strategies†are approximately calibrated when <i>K</i> is large. These strategies first...

Players choose an action before learning an outcome chosen according to an unknown and history-dependent stochastic rule. Procedures that categorize outcomes, and use a randomized variation on fictitious play within each category are studied. These procedures are “conditionally...

We examine games played by a single large player and a large number of opponents who are small, but not anonymous. If the play of the small players is observed with noise, and if the number of actions the large player controls is bounded as the number of small players grows, the equilibrium set...

We study a variation of fictitious play, in which the probability of each action is an exponential function of that action's utility against the historical frequency of opponents' play. Regardless of the opponents' strategies, the utility received by an agent using this rule is nearly the best...