We analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capacity needs to be allocated by a given deadline to sequentially arriving agents. Each agent is described by a two-dimensional type that reflects his capacity requirement and his willingness to pay...

A committee decides by unanimity whether to accept the current alternative, or to continue costly search. Each alternative is described by a vector of distinct attributes, and each committee member can privately assess the quality of one attribute (her "specialty"). Preferences are heterogeneous...

We study a multi-dimensional collective decision under incomplete information. Agents have Euclidean preferences and vote by simple majority on each issue (dimension), yielding the coordinate-wise median. Judicious rotations of the orthogonal axes -- the issues that are voted upon -- lead to...

We study a multidimensional collective decision under incomplete information. Agents have Euclidean preferences and vote by simple majority on each issue (dimension), yielding the coordinate‐wise median. Judicious rotations of the orthogonal axes—the issues that are voted upon—lead to...

We analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capacity needs to be allocated by a given deadline to sequentially arriving agents. Each agent is described by a two-dimensional type that reflects his capacity requirement and his willingness to pay...

A committee decides by unanimity whether to accept the current alternative, or to continue costly search. Each alternative is described by a vector of distinct attributes, and each committee member can privately assess the quality of one attribute (her "specialty"). Preferences are heterogeneous...