National Injunctions and Preclusion

Matching preclusion and Conditional Matching preclusion for Crossed Cubes

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those inci...

Anticompetitive Patent Injunctions

Strong matching preclusion

The matching preclusion problem, introduced by Brigham et al. [Perfect-matching preclusion, Congressus Numerantium 174 (2005) 185-192], studies how to effectively make a graph have neither perfect matchings nor almost perfect matchings by deleting as small a number of edges as possible. Extending this concept, we consider a more general matching preclusion problem, called the strong matching pr...

Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those indu...

Damages and injunctions in protecting intellectual property

We investigate how liability rules and property rules protect intellectual property. Infringement might not be deterred under any of the enforcement regimes available. However, counterintuitively, a credible threat of infringement can actually benefit the patentholder. We compare the two doctrines of damages, lost profit (lost royalty) and unjust enrichment, and argue that unjust enrichment pro...