Predatory Exclusive Dealing

While the previous literature on exclusive dealing has been concerned with the question of how exclusive dealing can raise static profits, this paper analyzes the question of how exclusive dealing can be used to predate in a dynamic context. It is shown that exclusive dealing may arise even if it reduces static profits. Exclusivity provisions may not only allow excluding efficient competitors, but indeed are often a cheaper exclusionary tool than predatory pricing. This is the case if the prey's access to finance is not too limited. Furthermore, it is more likely that exclusive dealing is preferable compared to predatory pricing the more market power the predator has with respect to the prey

Predatory Exclusive Dealing

While the previous literature on exclusive dealing has been concerned with the question of how exclusive dealing can raise static profits, this paper analyzes the question of how exclusive dealing can be used to predate in a dynamic context. It is shown that exclusive dealing may arise even if it reduces static profits. Exclusivity provisions may not only allow excluding efficient competitors, but indeed are often a cheaper exclusionary tool than predatory pricing. This is the case if the prey's access to finance is not too limited. Furthermore, it is more likely that exclusive dealing is preferable compared to predatory pricing the more market power the predator has with respect to the prey.exclusive dealing; predation

Functional Dependencies for Object Databases: Motivation and Axiomatization

Object identification by abstract identifiers should be considered as a modeling and not as a database concept. This means that object identifiers are not appropriate for the access to specific objects using a database language. In this paper we discuss how the relational concept of a functional dependency can be adapted to object databases in order to get more convenient ways of accessing objects. Graph based object functional dependencies are proposed as a means to specify constraints between attributes and object types of an object schema. Value based identification criteria can be defined using a special type of object functional dependencies. Different definitions of satisfaction are given for these constraints, based on a so-called validation relation, and their relationships are investigated. These definitions are related to different forms of identification. Using the strongest notion of satisfaction, inference rules for the derivation of new dependencies are discussed with emphasis on the characteristics of rules combining two dependencies, like the transitivity rule. In addition to generalized relational rules further rules are needed, mainly concerned with transition from the object type level to the attribute level and vice versa