Free Riders, Holdouts, and Public Use: A Tale of Two Externalities

Free riders and holdouts are market failures that potentially impede the completion of otherwise beneficial transactions. The key difference is that the free rider problem is a demand side externality that requires taxation to compel payment for a public good, while the holdout problem is a supply side externality that requires eminent domain to force the sale of land for large scale projects. This paper highlights that distinction between these two problems and uses the resulting insights to clarify the meaning of the public use requirement of the Fifth Amendment takings clause.

A Principal-Agent Model of Contracting in Major League Baseball

Traditional economic analyses of the reserve clause in major league baseball view it as having arisen from the superior bargaining of owners compared to players. This article interprets it instead as promoting efficient investment by teams in player development, given the transferability of player skills to other teams. Using a principal-agent framework, the article shows that limited player mobility emerges as part of the optimal contract between players (principals) and teams (agents).

Private Property, Public Use, and Just Compensation: The Economics of Eminent Domain

The eminent domain clause of the U.S. Constitution concerns the limits of the government's right to take private property for public use. The economic literature on this issue has examined (1) the proper scope of this power as embodied by the 'public use' requirement, (2) the appropriate definition, and implications, of 'just compensation,' and (3) the impact of eminent domain on land use incentives of owners whose land is subject to a taking risk. This essay reviews this literature and draws implications for our understanding of eminent domain law.

Changing Tides and Changing Focus: Mapping the Challenges and Successes of One State's Implementation Of the Adoption and Safe Families Act of 1997

In 1997, the Adoption and Safe Families Act shifted from the preservation of families to an emphasis on safety, permanency, and well-being through expediting the termination of parental rights, establishing exceptions to the reasonable efforts clause of preserving the family, and fiscal incentives for finalizing adoptions. The current project assessed the role of a full service array in achieving the outcomes set forth in ASF A. Concept mapping was utilized to elicit information from participants (both urban and rural) regarding the identified research question. Participants recognized family preservation versus safety, community connections, mandates versus reality, and worker recruitment and retention as critical components for meeting ASFA goals. Perceived importance and level of success in implementing these services was also highlighted. Recommendations supported through the data are also provided.

La estela de la Ley de Obispados de 1813 en la administración diocesana

Este trabajo aborda una de las resoluciones de la Asamblea del año XIII: la Ley de Obispados. Esta medida, y otras que estuvieron ligadas a ella, pretendieron dar solución a los problemas del ámbito eclesial. En este sentido y especialmente, nos referimos a la cláusula relativa a la retroversión de las facultades primitivas a los diocesanos o Provisores existentes en las Provincias Unidas. Esta medida obligaba a remitir todos los asuntos eclesiásticos a las cabeceras diocesanas, dando origen a una forma transicional de organización eclesiástica que colaborará en un nueva estructuración del mundo regular y en la reorganización de las Iglesias rioplatenses según una impronta marcada, en parte por los gobiernos políticos, como nos proponemos mostrar en el presente artículo

La estela de la Ley de Obispados de 1813 en la administración diocesana

Este trabajo aborda una de las resoluciones de la Asamblea del año XIII: la Ley de Obispados. Esta medida, y otras que estuvieron ligadas a ella, pretendieron dar solución a los problemas del ámbito eclesial. En este sentido y especialmente, nos referimos a la cláusula relativa a la retroversión de las facultades primitivas a los diocesanos o Provisores existentes en las Provincias Unidas. Esta medida obligaba a remitir todos los asuntos eclesiásticos a las cabeceras diocesanas, dando origen a una forma transicional de organización eclesiástica que colaborará en un nueva estructuración del mundo regular y en la reorganización de las Iglesias rioplatenses según una impronta marcada, en parte por los gobiernos políticos, como nos proponemos mostrar en el presente artículo

La estela de la Ley de Obispados de 1813 en la administración diocesana

Este trabajo aborda una de las resoluciones de la Asamblea del año XIII: la Ley de Obispados. Esta medida, y otras que estuvieron ligadas a ella, pretendieron dar solución a los problemas del ámbito eclesial. En este sentido y especialmente, nos referimos a la cláusula relativa a la retroversión de las facultades primitivas a los diocesanos o Provisores existentes en las Provincias Unidas. Esta medida obligaba a remitir todos los asuntos eclesiásticos a las cabeceras diocesanas, dando origen a una forma transicional de organización eclesiástica que colaborará en un nueva estructuración del mundo regular y en la reorganización de las Iglesias rioplatenses según una impronta marcada, en parte por los gobiernos políticos, como nos proponemos mostrar en el presente artículo

Normative Influences of "Special and Differential Treatment" on North-South RTAs

Recently, there has been a surge in bilateral and regional trade arrangements between developed and developing countries, which are known as North-South RTAs. Under the current legal system of the WTO, North-South RTAs are governed by Article XXIV of the GATT or Article V of the GATS, which means such RTAs must be reciprocal and must cover substantially all the trade. On the other hand, there is another category of rules on RTAs based on the so-called Enabling Clause, which, in exceptional circumstances, provides special and differential treatment (SDT) for RTAs among developing countries. This paper considers the applicability of the SDT concept to North-South RTAs by examining why rules on RTAs and the concept of SDT were incorporated into the GATT/WTO legal framework so as to permit the derogation of most-favored-nation (MFN) obligations.

How do free trade agreements reduce tariff rates and non-tariff barriers?

This paper empirically investigates how far free trade agreements (FTAs) successfully lower tariff rates and non-tariff barriers (NTBs) for manufacturing industries by employing the bilateral tariff and NTB data in a time series for countries around the world. We find that FTAs under GATT Article XXIV and the Enabling Clause contribute to reducing tariff rates by 2.1% points and 1.5% points, respectively. In the case of NTBs, their respective impacts are 6.6% points and 5.7% points. Membership in the World Trade Organization (WTO) does not contribute greatly to reducing tariff rates but does play a significant role in reducing NTBs. These results provide important implications for the literature on numerical assessments of FTAs.

Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses

We propose an analysis for detecting procedures and goals that are deterministic (i.e., that produce at most one solution at most once),or predicates whose clause tests are mutually exclusive (which implies that at most one of their clauses will succeed) even if they are not deterministic. The analysis takes advantage of the pruning operator in order to improve the detection of mutual exclusion and determinacy. It also supports arithmetic equations and disequations, as well as equations and disequations on terms,for which we give a complete satisfiability testing algorithm, w.r.t. available type information. Information about determinacy can be used for program debugging and optimization, resource consumption and granularity control, abstraction carrying code, etc. We have implemented the analysis and integrated it in the CiaoPP system, which also infers automatically the mode and type information that our analysis takes as input. Experiments performed on this implementation show that the analysis is fairly accurate and efficient.

Automated attribute inference in complex service workflows based on sharing analysis

The properties of data and activities in business processes can be used to greatly facilítate several relevant tasks performed at design- and run-time, such as fragmentation, compliance checking, or top-down design. Business processes are often described using workflows. We present an approach for mechanically inferring business domain-specific attributes of workflow components (including data Ítems, activities, and elements of sub-workflows), taking as starting point known attributes of workflow inputs and the structure of the workflow. We achieve this by modeling these components as concepts and applying sharing analysis to a Horn clause-based representation of the workflow. The analysis is applicable to workflows featuring complex control and data dependencies, embedded control constructs, such as loops and branches, and embedded component services.

Annotation algorithms for unrestricted independent and-parallelism in logic programs

We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator. This makes it possible to genérate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The difference between the two algorithms stems from whether the order of the solutions obtained is preserved or not. We also report on a preliminary evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.

Determinacy analysis for logic programs using mode and type information

We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (which implies that at most one of their clauses will succeed) even if they are not deterministic (because they cali other predicates that can produce more than one solution). Applications of such determinacy information include detecting programming errors, performing certain high-level program transformations for improving search efñciency, optimizing low level code generation and parallel execution, and estimating tighter upper bounds on the computational costs of goals and data sizes, which can be used for program debugging, resource consumption and granularity control, etc. We have implemented the analysis and integrated it in the CiaoPP system, which also infers automatically the mode and type information that our analysis takes as input. Experiments performed on this implementation show that the analysis is fairly accurate and efncient.

The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism

There has been significant interest in parallel execution models for logic programs which exploit Independent And-Parallelism (IAP). In these models, it is necessary to determine which goals are independent and therefore eligible for parallel execution and which goals have to wait for which others during execution. Although this can be done at run-time, it can imply a very heavy overhead. In this paper, we present three algorithms for automatic compiletime parallelization of logic programs using IAP. This is done by converting a clause into a graph-based computational form and then transforming this graph into linear expressions based on &-Prolog, a language for IAP. We also present an algorithm which, given a clause, determines if there is any loss of parallelism due to linearization, for the case in which only unconditional parallelism is desired. Finally, the performance of these annotation algorithms is discussed for some benchmark programs.

Towards structured state threading in prolog

It is very often the case that programs require passing, maintaining, and updating some notion of state. Prolog programs often implement such stateful computations by carrying this state in predicate arguments (or, alternatively, in the internal datábase). This often causes code obfuscation, complicates code reuse, introduces dependencies on the data model, and is prone to incorrect propagation of the state information among predicate calis. To partly solve these problems, we introduce contexts as a consistent mechanism for specifying implicit arguments and its threading in clause goals. We propose a notation and an interpretation for contexts, ranging from single goals to complete programs, give an intuitive semantics, and describe a translation into standard Prolog. We also discuss a particular light-weight implementation in Ciao Prolog, and we show the usefulness of our proposals on a series of examples and applications, including code directiy using contexts, DCGs, extended DCGs, logical loops and other custom control structures.