We study the class coNPMV of complements of NPMV functions. Though defined symmetrically to NPMV, this class exhibits very different properties. We clarify the complexity of coNPMV by showing that it is essentially the same as that of NPMVNP. Complete functions for coNPMV are exhibited and central complexity-theoretic properties of this class are studied. We show that computing maximum satisfyi...

Views over databases have recently regained attention in the context of data warehouses, which are seen as materialized views. In this setting, efficient view maintenance is an important issue, for which the notion of self-maintainability has been identified as desirable. In this paper, we extend self-maintainability to (query and update) independence, and we establish an intuitively appealing ...

We consider a network of sellers, each selling a single product, where the graph structure represents pair-wise complementarities between products. We study how the network structure affects revenue and social welfare of equilibria of the pricing game between the sellers. We prove positive and negative results, both of “Price of Anarchy” and of “Price of Stability” type, for simple graphs (line...

This paper develops a method to determine consistenly the integration of spatial integrity specifications, particularly for the case when two constraints, c1 and c2, are applied between three classes A, B, C (i.e., A c1 B and B c2 C), as such scenarios give rise to an implied consistency constraint c3 that holds between A and C. To determine c3, the mere composition reasoning with c1 and c2 is ...