Bilateral Bargaining in Networks

Each connected pair of nodes in a network can jointly produce one unit of surplus. A maximum number of linked nodes is selected in every period to bargain bilaterally over the division of the surplus, according to the protocol proposed by Rubinstein and Wolinsky (Econometrica 53 (1985), 1133-1150). All pairs, that reach an agreement, obtain the (discounted) payoffs and are removed from the network. This bargaining game has a unique subgame perfect equilibrium that induces the Dulmage-Mendelsohn decomposition (partition) of the bipartite network (of the set of nodes in this network).

A weighted bilateral shift with cyclic square is supercyclic

It is shown, for a bounded weighted bilateral shift T acting on l(p)(Z), and for 1

The application of a Trous wave filtering and Monte Carlo analysis on secis 2001 solar eclipse observations

Eight thousand images of the solar corona were captured during the June 2001 total solar eclipse. New software for the alignment of the images and an automated technique for detecting intensity oscillations using multi-scale wavelet analysis were developed. Large areas of the images covered by the Moon and the upper corona were scanned for oscillations and the statistical properties of the atmospheric effects were determined. The a Trous wavelet transform was used for noise reduction and Monte Carlo analysis as a significance test of the detections. The effectiveness of those techniques is discussed in detail.