BACKGROUND A near-universal finding internationally is that patient valuations of their own health, represented using the EQ-5D system, are mostly higher than general population valuations of the same EQ-5D states. This paper investigates whether this result also applies to New Zealand. Despite the EQ-5D's widespread use for cost-utility analysis in New Zealand, in particular by the Pharmaceuti...

Computational and economic results suggest that social welfare maximization and combinatorial auction design are much easier when bidders’ valuations satisfy the “gross substitutes” condition. The goal of this paper is to evaluate rigorously the folklore belief that the main take-aways from these results remain valid in settings where the gross substitutes condition holds only approximately. We...

Continuous valuations have been proposed by several authors as a way of modeling probabilistic non-determinism in programming language semantics. Let (X;O) be a topological space. A quasi-simple valuation on X is the sup of a directed family of simple valuations. We show that quasisimple valuations are exactly those valuations that extend to continuous valuations to the Alexandroff topology on ...

The term graceful degradation describes the smooth change to a lower state of some system aspect as a response to the occurrence of an event that prohibits the manifestation of the fully fledged system behavior. Graceful degradation has appeared in a variety of domains, from image processing and telecommunications to shared memory multiprocessors and multi-modular memory systems. In each domain...

In this paper some new type of odd graceful graphs are investigated. We prove that the graph obtained by joining a cycle C8 with some star graphs S1,r keeping one vertex and three vertices gap between pair of vertices of the cycle admits odd graceful labelling. We also prove that the graph obtained by joining a cycle C12 with some star graphs S1,r keeping two, three and five vertices gap betwee...

By strengthening an edge-decomposition technique for gracefully labelling a generalised Petersen graph, we provide graceful labellings for a new infinite family of such graphs. The method seems flexible enough to provide graceful labellings for many other classes of graphs in the future.

Hrnciar and Haviar [3] gave a method to a construct a graceful labeling for all trees of diameter at most five. Based on their method and the methods described in Balbuena et al [1], we shall describe a new construction for gracefully labeled trees by attaching trees to the vertices of a tree admitting a bipartite graceful labeling.

Abstract E-super arithmetic graceful labelling of a graph G is bijection f from the union vertex set and edge to positive integers (1, 2, 3, … |V(G) ∪ E(G)|) such that edges have labels {1, …, |E(G)|} induced mapping * given by (uv) = f(u) + f(v) − f(uv) for uv ∈ E(G) has range {|V(G) E(G)| 1, |V(G)| 2|E(G)|} In this paper we prove H i (m, m) (1) chain even cycles C 4,n , 6,n are graceful.

The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994. However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful. A conjecture is proposed.