This paper models interaction between groups of agents by means of a graph where each node represents a group of agents and an arc represents bilateral interaction. It departs from the standard Katz-Shapiro framework by assuming that network benefits are restricted only amongst groups of linked...

In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well-studied problem of minimum cost spanning...

We propose a new cost allocation rule for minimum cost Spanning tree games. The new rule is a core selection and also satisfices cost monotonicity. We also give charqcterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal difference between...

Some studies on child labor have shown that greater land wealth leads to higher child labor, thereby casting doubt on the hypothesis that child labor is caused by poverty. This paper argues that the missing ingredient is an explicit modeling of the labor market. We develop a simple model which...

This paper analyzes the formation of networks when players choose how much to invest in each relationship. We suppose that players have a fixed endowment that they can allocate across links, and in the baseline model, suppose that link strength is an additively separable and convex function of...

We construct a model of redistributive politics where the central government is opportunistic and uses its discretion to make transfers to state governments on the basis of political considerations. These considerations are the alignment between the incumbent parties at the central and state...

This paper uses the theoretical framework of the theory of tax reform to analyse whether a "small" change in an existing food subsidy program can be welfare-improving and revenue-neutral. It shows how existing econometric methods can be adapted to estimate demand parameters even when household...

We study mechanism design in quasi-linear environments when there are two alternatives. We show that under a mild range condition, every implementable deterministic allocation rule is a generalized utility function maximizer. In unbounded domains, if we replace our range condition by an...

We provide axiomatic characterizations of two natural families of rules for aggregating equivalence relations: the family of join aggregators and the family of meet aggregators. The central conditions in these characterizations are two separability axioms. Disjunctive separability, neutrality,...