Results 101 to 110 of about 3,305 (196)
An anytime approximation method for the inverse Shapley value problem
Coalition formation is the process of bringing together two or more agents so as to achieve goals that individuals on their own cannot, or to achieve them more efficiently.
Jennings, N. R. +3 more
core
— In this paper we consider the problem of increasing the throughput of cognitive radio in a cognitive radio network by forming coalitions among cognitive radio users. Recently there have been numerous studies exploring the benefits of the cooperation in
Tahir, Mohammad +5 more
core +1 more source
The Shapley value for airport and irrigation games [PDF]
In this paper cost sharing problems are considered. We focus on problems given by rooted trees, we call these problems cost-tree problems, and on the induced transferable utility cooperative games, called irrigation games.
Radványi, Anna +2 more
core
We study a recently developed centrality metric to identify key players in terrorist organisations due to Lindelauf et al. [2013]. This metric, which involves computation of the Shapley value for connectivity games on graphs proposed by Amer and Gimenez [
Rahwan, Talal +8 more
core
IMPLEMENTATION OF THE GALE-SHAPLEY ALGORITHM FOR AUTOMATING RECEPTION OF UNIVERSITY APPLICANTS [PDF]
Konstantin E. Ryskin +2 more
openaire +1 more source
A decentralized 3D printing service framework based on Gale-Shapley matching
With the increasing availability of mid-to-low price 3D printers, it is increasingly possible for individuals and medium-sized enterprises to own such machines. However, these owners rarely utilize the full capacity of these machines. The excess capacity
Mandhan, Naman
core
Evaluating the Performance of Sensor-based Bout Detection Algorithms: The Transition Pairing Method. [PDF]
Hibbing PR +3 more
europepmc +1 more source
Men cheating in the Gale-Shapley stable matching algorithm
We study strategy issues surrounding the stable marriage problem. Under the Gale-Shapley algorithm (with men proposing), a classical theorem says that it is impossible for every liar to get a better partner. We try to challenge this theorem.
Chien-chung Huang
core
Nash equilibria, gale strings, and perfect matchings
This thesis concerns the problem 2-NASH of finding a Nash equilibrium of a bimatrix game, for the special class of so-called “hard-to-solve” bimatrix games.
Merschen, Julian
core

