Increasing Network Value I: Transaction Value and Pricing

Connectivity value in a network is at least one metric for valuing networks. Others, such as Reed, have proposed other metrics such as group-forming value, but let's stick with connectivity value for a moment. Even in Web 2.0 and Enterprise 2.0, groups exist due to relationships which are based on transactions across connections.

If, as I've proposed, there are conditions where connectivity value is linear in the size of the network -- be it a communications network, a producer-consumer network, or anything else -- does that mean that networks have limited value?

Of course not.

If we define the connectivity value of a link as the expected value (i.e., likelihood-adjusted) of the net present value (i.e., adjusted for time value of money) of the transaction stream of that link, then one easy way to increase the value of the connection is to increase the size (i.e., value) of the transactions.

For example, if the connectivity value between me and my car dealer is defined by buying a car every four years, that connectivity value will increase if I buy a Lamborghini every four years instead of a used Yugo. (For those that don't know, the Yugo was of note when it went on sale in the '80s as the cheapest car sold in the U. S. Presumably used ones are still for sale).

Nothing has changed in the order of the value of the network: it is still order (n), in other words, proportional to the number of nodes, which in this case, are many car buyers and a relative few car dealers). However, if everyone started buying Lamborghinis instead of Yugos, the connectivity value of the "global automotive sales network" would increase by several orders of magnitude.

Of course, merely raising prices or selling more expensive products doesn't do the trick. Wal-Mart's revenues are higher than Henri Bendel's. As first steps, understanding price elasticity of demand (what would happen if we charged 10% more for this product) and using dynamic pricing for yield management (this is why airline seat prices appear to fluctuate randomly) can maximize total value of the system.

Also, price targeting, discussed in extremely readable fashion in "The Undercover Economist," by Tim Harford, subtly extracts more money from price insensitive or otherwise ignorant customers. He addresses three main mechanisms: individual targeting, group targeting, and "self-incrimination." It is this last technique that enables gourmet coffee shops to sell a cheap regular coffee right next to a $5.00 super half-caf iced mocha caramel choco-frappuccino. Lest you think that this is because of special hand-picked beans which cost more...it isn't. Tim assures us that the production and operations cost differential between cheap and expensive cups may be disregarded.

In summary, one way to increase the value of a network? Raise prices. Or lower them. Or change them dynamically. Whatever it takes to maximize the expected net present value of the connection. And, as Tim points out, in a free market economy such pricing represents the "truth" about what maximizes value to all parties in the transaction: consumers as well as producers.

On Metcalfe's Law

I recently wrote an article addressing Metcalfe's Law and related analyses from Reed and Briscoe, Odlyzko, and Tilly of network value. The summary of my analysis is that a number of factors can cause real world networks to have value substantially less than n squared. One factor is convergent value distributions, where each connection does not have equal value. Instead, if the distribution of connection values from each node converges to a limit, that drives the total network value to be only of order (n), in other words, linearly proportional to the size of the network.

Another factor is limits of consumption that are intrinsic to the type of network. If each user can hit an upper bound in money or time spent extracting value from the network, then the value of the network is also just linear. The actual article was published in Business Communications Review, but is available here as a pdf.

The analysis also applies indirectly to Reed's 2^n valuation of Web 2.0 networks based on their group-forming capabilities. Briefly, while it is true that there are 2^n (2 to the nth power) subgroups of a network, it is unlikely that they are all equally valuable. This makes the total value substantially less than 2^n.