We provide another characterization of the Banzhaf value for TU games without the additivity axiom, which also works within the class of simple games and within the class of superadditive games. Journal of Economic Literature Classification Number: C71.

The domain of polyconvex sets, i.e. finite unions of convex, compact, Euclidean sets, is large enough to encompass most of the opportunity sets typically encountered in economic environments, including non-linear or even non-convex budget sets, and opportunity sets arising from production sets. We provide a characterization of the volume-ranking as defined on the set of all polyconvex sets, rel...

While graphs are normally defined in terms of the 2-place relation of adjacency, we take the 3-place relation of interception as the basic primitive of the definition. The paper views graphs as an economic scheme for encoding interception relations, and establishes an axiomatic characterization of relations that lend themselves to representation in terms of graph interception, thus providing a ...

Engineered biological circuits are often disturbed by a variety of environmental factors. In batch culture, where the majority of synthetic circuit characterization occurs, environmental conditions vary as the culture matures. Turbidostats are powerful characterization tools that provide static culture environments; however, they are often expensive, especially when purchased in custom configur...

Daligault, Rao and Thomassé asked whether every hereditary graph class that is well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev (JCTB 2017+) gave a negative answer to this question, but their counterexample is a class that can only be characterised by infinitely many forbidden induced subgraphs. This raises the issue of whether the questio...

Abstract Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by exploring how some of these results over the finite field of order 2 extend to arbitrary fields and demonstrate that at least one third of the 62 ar...

PURPOSE This article makes an attempt to synthesize certain compounds containing thiazole and imidazole moieties and screen for the antimicrobial properties. METHODS The novel compounds synthesized were characterized by elemental analysis, IR and (1)HNMR spectral data. The antimicrobial activity of novel compounds was evaluated by cup plate method. RESULTS The compound p-t showed more antib...

In this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, su2cient to imply that a 2-connected graph of su2ciently large order is hamiltonian. c © 2002 Elsevier Science B.V. All rights reserved.

No silicon fabrication and characterization of circuits with topologies designed by evolution has been done before, leaving open questions about the feasibility of the evolutionary design approach, as well as on how highperformance, robust, or portable such designs could really be when implemented in hardware. This paper is the first to report on a silicon implementation of circuits evolved in ...

A poset P = (X,≺) is a unit OC interval order if there exists a representation that assigns an open or closed real interval I(x) of unit length to each x ∈ P so that x ≺ y in P precisely when each point of I(x) is less than each point in I(y). In this paper we give a forbidden poset characterization of the class of unit OC interval orders and an efficient algorithm for recognizing the class. Th...