Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class Cα consists of all simple games permitting a weighted representation such that each winning coalition has a weight of at least 1 and each losing coalition a weight of at most α. For...

We consider an extension of strategic normal form games with a phase of negotiations before the actual play of the game, where players can make binding offers for transfer of utilities to other players after the play of the game, in order to provide additional incentives for each other to play designated strategies. Such offers are conditional on the recipients playing the specified strategies ...

Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class Cα consists of all simple games permitting a weighted representation such that each winning coalition has a weight of at least 1 and each losing coalition a weight of at most α. For...

In this paper we point out that standard PDL-like logics with intersection are useful for reasoning about game structures. In particular, they can express coalitional ability operators known from coalition logic and ATL. An advantage of standard, normal, modal logics is a well understood theoretical foundation and the availability of tools for automated verification and reasoning. We study a mi...

We present a model of multi-party, “spatial” competition under proportional rule with both electoral and coalitional risk. Each party consists of a set of delegates with heterogeneous policy preferences. These delegates choose one delegate as leader or agent. This agent announces the policy declaration (or manifesto) to the electorate prior to the election. The choice of the agent by each party...

Coalitional games, including Coalition Structure Generation (CSG), have been attracting considerable attention from the AI research community. Traditionally, the input of a coalitional game is a black-box function called a characteristic function. Previous studies have found that many problems in coalitional games tend to be computationally intractable in this black-box function representation....

In this paper, channel assignment for spectrum sensing is studied in multi-channel cognitive radio networks to maximize the number of channels satisfying sensing performance (called available channels). Beginning with a nonlinear integer programming problem, we derive the upper bound of optimal value through many-to-many assignment problem and then propose three algorithms for both centralized ...

We propose an incentive routing and forwarding scheme that integrates a reputation system into a monetary payment mechanism to encourage nodes cooperation in wireless ad hoc networks. For the first time in the literature, we build our reputation system based on a heat diffusion model. The heat diffusion model provides us a way of combining the direct and indirect reputation together and propaga...