arXiv subjects

Stefano Nasini

Publications and source records attributed to Stefano Nasini.

4 recordsLinked to original sources

arXiv2025

Learning Paths to Multi-Sector Equilibrium: Belief Dynamics Under Uncertain Returns to Scale

This paper explores the dynamics of learning in a multi-sector general equilibrium model where firms operate under incomplete information about their production returns to scale. Firms iteratively update their beliefs using maximum a-posteriori estimation, derived from observed production outcomes, to refine their knowledge of their returns to scale. The implications of these learning dynamics for market equilibrium and the conditions under which firms can effectively learn their true returns to scale are the key objects of this study. Our results shed light on how idiosyncratic shocks influence the learning process and demonstrate that input decisions encode all pertinent information for belief updates. Additionally, we show that a long-memory (path-dependent) learning which keeps track of all past estimations ends up having a worse performance than a short-memory (path-independent) approach.

cs.GT↗

arXiv2015

A joint model for authors characteristics and collaboration pattern in bibliometric networks: a Bayesian approach

Demographic and behavioral characteristics of journal authors are important indicators of homophily in co-authorship networks. In the presence of correlations between adjacent nodes (assortative mixing), combining the estimation of the individual characteristics and the network structure results in a well-fitting model, which is capable to provide a deep understanding of the linkage between individual and social properties. This paper aims to propose a novel probabilistic model for the joint distribution of nodal properties (authors' demographic and behavioral characteristics) and network structure (co-authorship connections), based on the nodal similarity effect. A Bayesian approach is used to estimate the model parameters, providing insights about the probabilistic properties of the observed data set. After a detailed analysis of the proposed statistical methodology, we illustrate our approach with an empirical analysis of co-authorship of 1007 journal articles indexed in the ISI Web of Science database in the field of neuroscience between 2009 and 2013.

stat.AP↗

arXiv2015

Bartering integer commodities with exogenous prices

The analysis of markets with indivisible goods and fixed exogenous prices has played an important role in economic models, especially in relation to wage rigidity and unemployment. This research report provides a mathematical and computational details associated to the mathematical programming based approaches proposed by Nasini et al. (accepted 2014) to study pure exchange economies where discrete amounts of commodities are exchanged at fixed prices. Barter processes, consisting in sequences of elementary reallocations of couple of commodities among couples of agents, are formalized as local searches converging to equilibrium allocations. A direct application of the analyzed processes in the context of computational economics is provided, along with a Java implementation of the approaches described in this research report.

q-fin.GN↗

arXiv2014

Maximizing graph probability under conditionally exponential models

Designing reliable networks consists in finding topological structures, which are able to successfully carry out desired processes and operations. When this set of activities performed within a network are unknown and the only available information is a probabilistic model reflecting topological network features, highly probable networks are regarded as "reliable", in the sense of being consistent with those probabilistic model. In this paper we are studying the reliability maximization, based on the Exponential Random Graph Model (ERGM), whose statistical properties has been widely used to capture complex topological feature of real-world networks. Under such models the probability of a network is maximized when specified structural properties appear in the network. However, the search of maximally reliable (highly probable) networks might result in difficult combinatorial optimization problems and an important goal of this work is to translate them into solvable systems of linear constraints. Analytical and numerical results are provided, using exact optimization techniques and efficient computer implementation.

math.OC↗