We survey and discuss several solution concepts for infinite turn-based multiplayer games with qualitative (i.e. win-lose) objectives of the players. These games generalise in a natural way the common model of games in verification which are two-player, zero-sum games with ω-regular winning conditions. The generalisation is in two directions: our games may have more than two players, and the ob...

Solution concepts are a fundamental tool for the analysis of game-like systems, and as a consequence, much effort has been devoted to the problem of characterising solution concepts using logic. However, one problem is that, to characterise solution concepts such as Nash equilibrium, it seems necessary to refer to strategies in the object language, which tends to complicate the object language....

This paper provides a framework for implementing and comparing several solution concepts for transferable utility cooperative games. We construct bidding mechanisms where players bid for the role of the proposer. The mechanisms differ in the power awarded to the proposer. The Shapley, consensus and equal surplus values are implemented in subgame perfect equilibrium outcomes as power shifts away...

In this work different concepts of efficient solutioos to problems of Stochastic Multiple Objective Prograrnming are analyzed. We centre OUT interest on problems in which sorne of the objective functions depelld on random parameters. The existence of different concepts of efficiency for oue single stochastic problem, 8uch as expected value efficiency, minimum-risk efficiency, etc., raise the qu...

The rapidly growing world population and booming economies are two of the major reasons for an increasing demand for buildings and infrastructure. In order to meet these needs large amounts of energy and raw materials are required. In most cases concrete is the main building material for these structures. The question today is how these needs can be accomplished without compromising the ability...

In cooperative game theory, it is typically assumed that the value of each coalition is known. We depart from this, assuming that v(S) is only a noisy estimate of the true value V (S), which is not yet known. In this context, we investigate which solution concepts maximize the probability of ex-post stability (after the true values are revealed). We show how various conditions on the noise char...

We show how game-theoretic solution concepts such as Nash equilibrium, correlated equilibrium, rationalizability, and sequential equilibrium can be given a uniform definition in terms of a knowledge-based program with counterfactual semantics. In a precise sense, this program can be viewed as providing a procedural characterization of rationality.

Norde et al. [Games Econ. Behav. 12 (1996) 219] proved that none of the equilibrium concepts in the literature on equilibrium selection in finite strategic games satisfying existence is consistent. A transition to set-valued solution concepts overcomes the inconsistency problem: there is a multiplicity of consistent set-valued solution concepts that satisfy nonemptiness and recommend utility ma...