We introduce a new approach to bargaining, with strategic and axiomatic foundations, into models of decentralized asset markets. According this approach, which encompasses the Nash (1950) solution as special case, bilateral negotiations follow an agenda that partitions assets bundles be sold sequentially. construct two alternating-offer games consistent characterize their subgame perfect equili...

I characterize the proportional N -person bargaining solutions by individual rationality, translation invariance, feasible set continuity, and a new axiom— interim improvement. The latter says that if the disagreement point d is known, but the feasible set is not—it may be either S or T , where S ⊂ T—then there exists a point d′ ∈ S, d′ > d, such that replacing d with d′ as the disagreement poi...

We study the online convex optimization problem, in which an online algorithm has to make repeated decisions with convex loss functions and hopes to achieve a small regret. We consider a natural restriction of this problem in which the loss functions have a small deviation, measured by the sum of the distances between every two consecutive loss functions, according to some distance metrics. We ...

There are several major proposals for treating donkey anaphora such as discourse representation theory and the likes, or E-Type theories and the likes. Every one of them works well for a set of specific examples that they use to demonstrate validity of their approaches. As I show in this paper, however, they are not very generalisable and do not account for essentially the same problem that the...

Ultimate Opening (UO) is a powerful operator based on numerical residues. In a multi-scale framework, it analyzes an image under a series of increasing openings. Contrasted objects are detected when they are filtered out by an opening, generating an important residue. Gradual transitions make this operator underestimate the contrast of blurred objects. In this paper we propose a solution to thi...

The Internet-wide deployment of new protocols such as the Stream Control Transmission Protocol (SCTP) is a difficult matter. The employment of SCTP would be beneficial in many cases, but it is a major challenge to enable applications to use the new protocol at both ends, client and server. The prevalence of the Transmission Control Protocol (TCP), which has been established as the dominant tran...

We introduce the notion of gradually stabilizing algorithm as any self-stabilizing algorithm achieving the following additional feature. Assuming that at most τ dynamic steps occur starting from a legitimate configuration, a gradually stabilizing algorithm first quickly recover to a configuration from which a specification offering a minimum quality of service is satisfied. It then gradually co...

Gradual learning as gradual adjustment of constraint values (Rosenblatt 1962, Boersma 1998) automatically yields weighting values that can be used in an account of gradient phonotactics, if the grammar is formulated in terms of Harmonic Grammar (HG; Legendre, Smolensky and Miyata 1990). I propose a new metric for gradient acceptability in HG, and show how a complex case of gradient phonotactics...