arXiv subjects
Publications and source records attributed to Lucas Vernet.
Galichon, Samuelson and Vernet (2022) introduced a class of problems, equilibrium flow problems, that nests several classical economic models such as bipartite matching models, minimum-cost flow problems and hedonic pricing models. We establish conditions for the existence of equilibrium prices in the equilibrium flow problem, in the process generalizing Hall's theorem.
We introduce a notion of substitutability for correspondences and establish a monotone comparative static result, unifying results such as the inverse isotonicity of M-matrices, Berry, Gandhi and Haile's identification of demand systems, monotone comparative statics, and results on the structure of the core of matching games without transfers (Gale and Shapley) and with transfers (Demange and Gale). More specifically, we introduce the notions of 'unified gross substitutes' and 'nonreversingness' and show that if Q is a supply correspondence defined on a set of prices P which is a sublattice of R^N, and Q satisfies these two properties, then the set of prices yielding supply vector q is increasing (in the strong set order) in q; and it is a sublattice of P.
This article presents a set of tools for the modeling of a spatial allocation problem in a large geographic market and gives examples of applications. In our settings, the market is described by a network that maps the cost of travel between each pair of adjacent locations. Two types of agents are located at the nodes of this network. The buyers choose the most competitive sellers depending on their prices and the cost to reach them. Their utility is assumed additive in both these quantities. Each seller, taking as given other sellers prices, sets her own price to have a demand equal to the one we observed. We give a linear programming formulation for the equilibrium conditions. After formally introducing our model we apply it on two examples: prices offered by petrol stations and quality of services provided by maternity wards. These examples illustrate the applicability of our model to aggregate demand, rank prices and estimate cost structure over the network. We insist on the possibility of applications to large scale data sets using modern linear programming solvers such as Gurobi. In addition to this paper we released a R toolbox to implement our results and an online tutorial (http://optimalnetwork.github.io)