We study a system where many identical users of a service share a common resource. Each user is sensitive to congestion at the resource, but also experiences a positive network ef...
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
We designed and built the Gates Hillman Prediction Market (GHPM) to predict the opening day of the Gates and Hillman Centers, the new computer science buildings at Carnegie Mellon...
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
Recent years have seen extensive investigation of the information aggregation properties of prediction markets. However, relatively little is known about conditions under which a ...
Krishnamurthy Iyer, Ramesh Johari, Ciamac Cyrus Mo...
Current automated market makers over binary events suffer from two problems that make them impractical. First, they are unable to adapt to liquidity, so trades cause prices to mo...
Abraham Othman, Tuomas Sandholm, David M. Pennock,...
“North” ads, or sponsored listings appearing just above the organic search results, generate the majority of clicks and revenues for search engines. In this paper, we ask whet...
The Combinatorial Public Projects Problem s an abstraction of resource allocation problems in which agents have preferences over alternatives, and an outcome that is to be collect...
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...