We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...