Sequential trials and the English rule

The allocation of trial costs and the way a trial progresses are two important issues in civil procedure. The combination of these two elements has received relatively little attention in the law and economics literature. The prior literature has only compared unitary litigation (e.g. liability and damage issues are litigated, after which the court decides on both issues) under the American rule with sequential litigation (e.g. the parties first litigate the liability issue after which the court makes a decision, and then if still necessary the parties litigate the damages issue) under the American rule. In this article, I examine the influence of sequential litigation when the loser at trial pays all the litigation costs and compare the results with (a) the situation in which litigation is unitary and the loser pays all the litigation costs and (b) the situation in which litigation is sequential and each party bears her own costs. I focus on the incentive to sue, the incentive to settle (or to litigate) and on the settlement amount. Some interesting differences with the previous literature are discussed in detail

Assessing Needs of Care in European Nations. ENEPRI Policy Brief No. 14, 28 December 2012

This Policy Brief presents the research questions, main results and policy implications and recommendations of the seven Work Packages that formed the basis of the ANCIEN research project, financed under the 7th EU Research Framework Programme of the European Commission. Carried out over a 44-month period and involving 20 partners from EU member states, the project principally concerns the future of long-term care (LTC) for the elderly in Europe and addresses two questions in particular: How will need, demand, supply and use of LTC develop? How do different systems of LTC perform

Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison

Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there is constraint logic programming which computes a solution as an answer substitution to a query containing the variables of the constraint satisfaction problem. On the other hand there are systems based on stable model semantics, abductive systems, and first order logic model generators which compute solutions as models of some theory. This paper compares these different approaches from the point of view of knowledge representation (how declarative are the programs) and from the point of view of performance (how good are they at solving typical problems).Comment: 15 pages, 3 eps-figure