We model a hierarchy consisting of possibly corrupted agents who process information, and consider the problem of designing the efficient hierarchy structure and configuring the agents who differ in their honesty. If the only role of agents is to report the information to their direct superior,...

This paper presents a model of price screening for goods with network effects, by a monopoly seller, and by an entry-deterring monopolist. These products are used in variable quantities by heterogeneous customers, the magnitude of network effects is influenced by gross consumption, rather than...

In this paper a public bureau can extract surplus value from the services it provides not only by misrepresenting its production costs to its oversight committee but also by influencing the perceptions of the legislative body such as the parliament or the congress and the public at large by...

Why would a political elite voluntarily dilute its political power by extending the voting franchise? This paper develops a dynamic recursive framework for studying voter enfranchisement. We specify a class of dynamic games in which political rights evolve over time. Each period, private...

Ascending price clock auctions with drop-out information typically yield outcomes closer to equilibrium predictions than do comparable sealed-bid auctions. However clock auctions require congregating all bidders for a fixed time interval, which has limited field applicability and introduces...

We consider a multi-awards generalization of King Solomon's problem: $k$ identical and indivisible awards should be distributed among $n$ agents, $k<n$, with the top $k$ valuation agents receiving the awards. Agents have complete information about each others' valuations. Glazer and Ma (1989) analyzed the single-prize (i.e., $k=1$) version of this problem. We show that in the `more than two agents' problem the mechanism of Glazer and Ma admits inefficient equilibria and thus fails to solve Solomon's problem. So, first we modify their mechanism to rule out inefficient equilibria and implement efficient prize allocation in subgame perfect equilibrium when there are at least three agents. Then it is shown that a simple repeated application of our modified mechanism will distribute $k\;(>1)$ prizes efficiently in subgame perfect equilibria without any monetary transfers in equilibrium. Finally, in the multi-awards case we relax the...</n$,>