In this paper, a new framework to study weighed networks is introduced. The idea behind this methodology is to consider that each node of the network is an agent that desires to satisfy his/her preferences in an economic sense. Moreover, the formation of a link between two agents depends on the benefits and costs associated to this link. Therefore, an edge between two given nodes will only arise if the tradeoff between satisfaction and cost for building it is jointly positive. Using a computational framework, I intend to show that depending on the agents combination of benefits and costs, some very well known networks can naturally arise.PACS numbers: During recent years, one of the main issues of the statistical physics literature has been the study of dynamic systems such as airports, wireless links, financial institutions, web pages and other communication networks and social networks that may be described by complex weblike structures [24].On one hand, several models such as small world networks [1,2] and free scale networks [3] have been introduced to specially accommodate the particularities of these structures that could not be modeled by the seminal well known random graphs [4]. One should notice that although most attempts have been devoted to the study of unweighed undirected networks as the ones presented in [1,3], recently some researchers have also introduced models to deal with undirected weighted networks [5] and also directed digraphs [6].On the other hand, several measures have been presented aiming at characterizing the properties of these networked systems, for instance, characteristic path length [7] [11]. The main advantage of using these measures to analyze these complex structures is the ability to compare different systems with each other and also to develop a unified theory to approach these systems. This paper focuses particularly on undirected weighted graphs. It proposes another way based on economic and decision theory to cope with these systems. I suppose that each node of the network is an agent [25] that has his/her own preferences and is "starving" to maximize them. Since all agents in the network will interact in order to maximize their preferences, an edge between two given nodes will only arise if the tradeoff between satisfaction and cost for building it is jointly positive. It is assumed that this happens when the benefit brought to an agent is greater than his own cost and the cost left by the other agent (that sometimes is zero). Therefore, if the benefits brought to the agents by the edge are positive enough to compensate the cost of construction, then the edge will exist. This makes sense if one considers that a connection between agents always brings some kind of benefits, but the connection sometimes does not exist in a given network because of the high costs involved.This tradeoff just presented above is very related to the formalism developed by [8,9] since the authors also seek a tradeoff between satisfaction (measured in a very specific way as efficiency of commun...