An earlier version of Service Architecture and Content Provision, as presented at the Telecom Policy Research Conference 1995. There are some additional mathematical examples, and a short section on the effects of architecture on content creation that we did not include in the published version

A given set of users share the submodular cost of access to a network (or, more generally, the submodular cost of any idiosyncratic binary good). We compare strategyproof mechanisms that serve the efficient set of users (but do not necessarily balance the budget) with those that exactly cover...

This paper describes the results of simulation experiments performed on a suite of learning algorithms. We focus on games in network contexts. These are contexts in which (1) agents have very limited information about the game; users do not know their own (or any other agent's) payoff function,...

We address the problem of learning and implementation on the Internet. When agents play repeated games in distributed environments like the Internet, they have very limited {\em a priori} information about the other players and the payoff matrix, and the play can be highly asynchronous....

We present the results of an experiment on learning in a continuous-time low-information setting. For a dominance solvable version of a Cournot oligopoly with differentiated products, we find little evidence of convergence to the Nash equilibrium. In an asynchronous setting, characterized by...

We consider the sharing of the cost of producing a homogeneous good when the technology has variable returns and individuals have arbitrary demands. We give a full analytical description of the family of costsharing methods that allocate costs in proportion to demands when returns are constant,...