This paper considers a trading problem on a network with incomplete information. We consider a simple water trading problem in which three agents are located in a linear order along a river. Upper stream agents can sell some amount of the water to their downstream but not the other way around....

In an environment in which agents have nonlinear utility and sufficiently asymmetric initial endowments, we show that efficient trading is achievable. This result is in contrast with Myerson and Satterthwaite (1983), which shows efficient trading is not possible if agents have linear utility and...

Metro station corridor width design considering demand fluctuation as well as the randomness and state-dependence of service time is an urgent concern and a complicated random planning issue. This paper confirms the accuracy of phase-type distribution (PH) fitting for passenger arrival intervals...

We analyze optimal trading mechanisms in environments where each trader owns some units of a good to be traded and may be either a seller or a buyer, depending on the realization of privately observed valuations. First, the concept of virtual valuation is extended to ex ante unidentified...

Determining community structure in networks is fundamental to the analysis of the structural and functional properties of those networks, including social networks, computer networks, and biological networks. Modularity function Q, which was proposed by Newman and Girvan, was once the most...

We analyze optimal trading mechanisms in an exchange economy where each trader owns some units of a good to be traded and may be either a seller or a buyer, depending on the realization of the privately observed valuations. The concept of virtual valuation is extended to ex ante unidentified...

A polluted river network is populated with agents (e.g., firms, villages, municipalities, or countries) located upstream and downstream. This river network must be cleaned, the costs of which must be shared among the agents. We model this problem as a cost sharing problem on a tree network....

We establish a new envelope theorem in which the choice variables are discrete and the objective function and the constraints are Lipschitz continuous with respect to the parameters. The parameters can be ?nite or in?nite dimensional vectors in a Banach space. In an application, we revisit the...