Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm of infinite-state multi-agent systems. Alternatingtime temporal logics are well-known specification formalisms for multi-agent systems, where the selective path quantifier is introduced to reason about strategies of agents. In this paper, we investigate model checking algorithms for variants of a...

To generate big responses of unemployment to productivity shocks in a business cycle context or to productivity changes in a welfare state context, researchers have reconfigured matching models in various ways, e.g., by elevating the utility of leisure, by making wages sticky, by assuming alternating-offer wage bargaining, by introducing fixed matching costs, and the costly acquisition of credi...

As far as we know, for most polynomially solvable network optimization problems, their inverse problems under l1 or l∞ norm have been studied, except the inverse maximum-weight matching problem in non-bipartite networks. In this paper we discuss the inverse problem of maximum-weight perfect matching in a non-bipartite network under l1 and l∞ norms. It has been proved that the inverse maximum-we...

Microscopic oil displacement of water flooding and sweep efficiency of continuous gas injection could be improved by water alternating gas (WAG) injection. The WAG injection process aims to squeeze more oil out of the reservoirs; in this method, water and gas are alternatively injected into the reservoir. Also, availability of hydrocarbon or CO2 gases in the field makes it attractive for gas-ba...

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

The appearance of numbers enumerating alternating sign matrices in stationary states of certain stochastic processes on matchings is reviewed. New conjectures concerning nest distribution functions are presented as well as a bijection between certain classes of alternating sign matrices and lozenge tilings of hexagons with cut off corners.

The appearance of numbers enumerating alternating sign matrices in stationary states of certain stochastic processes onmatchings is reviewed.New conjectures concerning nest distribution functions are presented as well as a bijection between certain classes of alternating sign matrices and lozenge tilings of hexagons with cut off corners. © 2005 Elsevier B.V. All rights reserved.