Rough Justice or Zero Tolerance? - Reassessing the Nature of Copyright in Light of Collective Licensing (Part I)

Starting point in the European individualistic copyright ideology is that an individual author creates a work and controls the use of it. However, this paper argues that it is (and has always been) impossible to control the use of works after their publication. This has also been acknowledged by the legislator, who has introduced collective licensing agreements because of this impossibility. Since it is impossible to rigorously control the use of works this writing "Rough Justice or Zero Tolerance - Reassessing the Nature of Copyright in Light of Collective Licensing" examines what reality of copyright is actually about. Finding alternative (and hopefully more "true") ways to understand copyright helps us to create alternative solutions in order to solve possible problems we have as it comes e.g. to use of content in online environment. The paper makes a claim that copyright is actually about defining negotiation points for different stakeholders and that nothing in the copyright reality prevents us from defining e.g. a new negotiation point where representatives of consumers would meet representatives of right holders in order to agree on the terms of use for certain content types in online environment.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.