A network payoff function assigns a utility to all participants in a (social) network. In this paper we discuss properties of such network payoff functions that guarantee the existence of certain types of pairwise stable networks and the convergence of certain network formation processes. In...

In this paper, we pursue the work of H. Haller and al. (2005, [10]) and examine the existence of equilibrium networks, called Nash networks, in the noncooperative two-way flow model (Bala and Goyal, 2000, [1]) with partner heterogeneous agents. We show through an example that Nash networks do...

This paper introduces a partner heterogeneity assumption in the one-way flow model of Bala and Goyal (2000, [1]). Our goal consists in the characterization of strict Nash networks with regard to the set of resources obtained by players. We use the notion of condensation network which allows us...

Previous studies have demonstrated that a multitude of options can lead to choice overload, reducing decision quality. Through controlled experiments, we examine sequential choice architectures that enable the choice set to remain large while potentially reducing the effect of choice overload. A...

Previous studies have demonstrated that a multitude of options can lead to choice overload, reducing decision quality. Through controlled experiments, we examine sequential choice architectures that enable the choice set to remain large while potentially reducing the effect of choice overload. A...