This article explores the complex dynamics of financial innovation in early modern times, challenging linear models of temporal and spatial divisions that tend to shape our understanding of the evolution of financial systems. It supports the idea that innovation should be viewed as a non-linear and contextual process, involving diverse stakeholders and characterised by interactions and unexpected occurrences. The study focuses on the dissemination and trajectories of financial innovations, specifically the bill of exchange and its variation, the ricorsa, as well as the transferability and negotiability of commercial paper. It does so by investigating the interactions and exchanges between merchants and bankers from diverse backgrounds during the sixteenth-century Lyon fairs, using the archival records of one of the first Italian banks in Lyon (Salviati). The study reveals the mutual influence and acculturation among these agents and challenges the compartmentalisation of financial expertise. Through an analysis of transactions recorded in the Salviati bank's ledgers, the article highlights previously unknown uses of commercial paper by Southern merchant communities and discusses the factors that may have hindered the full-scale development of endorsement and discount in the Lyon trading networks, despite their potential benefits. The results provide insights into the intricate nature of financial innovation and the influence of structural and cultural factors on its development.

We discuss a bi-objective two-stage assignment problem (BiTSAP) that aims at minimizing two objective functions: one comprising a nonlinear cost function defined explicitly in terms of assignment variables and the other a total completion time. A two-stage assignment problem deals with the optimal allocation of n jobs to n agents in two stages, where $n_1$ out of n jobs are primary jobs which constitute Stage-1 and the rest of the jobs are secondary jobs constituting Stage-2. The paper proposes an algorithm that seeks an optimal solution for a BiTSAP in terms of various efficient time-cost pairs. An algorithm for ranking all feasible assignments of a two-stage assignment problem in order of increasing total completion time is also presented. Theoretical justification and numerical illustrations are included to support the proposed algorithms.

The case law and literature to date have struggled to locate the rationale for the assignability of arbitration agreements. While different justifications have been proffered, each of them rests on questionable premises. This has given rise to a host of uncertainties over the rules which apply in practice. This paper proposes that a satisfactory rationale can be found in the “acceptance principle”. This principle indicates, first, that arbitration agreements which are not actual burdens can be assigned, and second, that the assignability of arbitration agreements is grounded in the assignee's acceptance in the form of non-disclaimer of the assignment. Bringing the acceptance principle to the fore not only provides a theoretically sound justification for the assignability of arbitration agreements; it also suggests how the practical uncertainties in this area of law can be resolved satisfactorily.

This paper discusses grammatical gender in Norwegian by bringing together data from first language acquisition, Norwegian heritage language, and dialect change. In all these contexts, gender is often claimed to be a vulnerable category, arguably due to the relative non-transparency of gender assignment. Furthermore, the feminine gender is in the process of being lost in many Norwegian dialects, as feminine agreement forms (for example, the indefinite article) are merged with the masculine. The definite suffix, in contrast, is quite stable, as it is acquired early and does not undergo attrition/change. We argue that the combined data provide evidence that gender and declension class are separate phenomena, and we outline a possible formal analysis to account for the findings.*

When should a contractual right be assignable to a non-party? English law's answer to this question is complex, and many of its rules are difficult to justify. In some respects, the law appears unreasonably pro-assignment, whereas sometimes it denies assignability to rights that should be assignable. This article contends that, in developing the law of assignability, the judiciary and Parliament have relied on a series of dubious ideas that deviate from the law's usual approach to contracts, and the current law rests partly on intuitive policy rationales that do not withstand scrutiny. The main aim of the article is to propose a new framework for thinking about the law of assignability that is more closely aligned with general ideas about contract law.

By an assignment we mean a mapping from a Choquet simplex $K$ to probability measure-preserving systems obeying some natural restrictions. We prove that if $\unicode[STIX]{x1D6F7}$ is an aperiodic assignment on a Choquet simplex $K$ such that the set of extreme points $\mathsf{ex}K$ is a countable union $\bigcup _{n}E_{n}$, where each set $E_{n}$ is compact, zero-dimensional and the restriction of $\unicode[STIX]{x1D6F7}$ to the Bauer simplex $K_{n}$ spanned by $E_{n}$ can be ‘embedded’ in some topological dynamical system, then $\unicode[STIX]{x1D6F7}$ can be ‘realized’ in a zero-dimensional system.

In recent years two views have developed as to the efficacy of prohibitions on the assignment of contractual rights. One view, “the property view”, dictates that such prohibitions characterise contractual rights as choses in action and robs them of their transferable nature. Another view, “the contract view”, dictates that such prohibitions operate only at the level of contract and cannot prevent the equitable assignment of the benefit of a contract. Both views have judicial and academic support. The view that is ultimately adopted will have important implications for contract drafting and the law of assignment. This paper explains both views and puts forward an argument for adopting the property view.

We report the isolation, development and multiplex optimisation of 12 new microsatelliteloci for the great scallop, Pecten maximus. Diversity was moderate tohigh, with number of alleles ranging from 4 to 20 and observed heterozygosity between 0.28and 0.88. Progeny produced in a commercial hatchery was used to test locus power forparentage assignment. The percentage of offspring that was unambiguously assigned to aunique pair of parents was 97% (software package CERVUS-COLONY). Parentage assignmentrevealed that 22% of the studied progeny resulted from unplanned crosses. Effectivepopulation size of the study progeny was also estimated. Our study illustrates the powerof microsatellites for the genetic monitoring of hatchery-produced great scallops.

In this paper, we analyse the multiobjective problem generated byapplying a goal programming approach to deal with linearassignment type problem. We specify sufficient conditions for asolution to be efficient for this problem. The notion ofefficiency with respect to a neighborhood is also introduced andcharacterized through sufficient conditions. Unfortunately, theseconditions are not necessary in general.

We consider an N-server queue with arbitrary arrivals and service times which are random but with differing rates for different servers. Customers arriving when all servers are occupied do not enter the system. We show that the policy of always assigning an arrival to that free server whose service rate is largest (smallest) stochastically minimises (maximises) the number in the system. We then show that in a particular component-repair context with exponential repair times the policy of repairing failed components with the smallest failure rate stochastically maximises the number of working components.