Search Results - subject:"matching game"

Narrow search

Optimal Radio Access Network Selection in Multi-RAT HetNets Using Matching Game Approach

Anany, M. G.; El Din, Eman Serag; Elmesalawy, Mahmoud M. - 2019

LTE Multi-RAT HetNet, where matching game approach is applied. In this algorithm, UEs propose to their best candidate …

Persistent link: https://www.econbiz.de/10012049418

Optimal radio access network selection in Multi-RAT HetNets using matching game approach

Anany, M. G.; El Din, Eman Serag; Elmesalawy, Mahmoud M. - 2019

LTE Multi-RAT HetNet, where matching game approach is applied. In this algorithm, UEs propose to their best candidate …

Persistent link: https://www.econbiz.de/10012150513

Solutions for the Stable Roommates Problem with Payments

Biró, Péter; Bomhoff, Matthijs; Golovach, Petr A.; … - 2012

The stable roommates problem with payments has as input a graph G(E,V) with an edge weighting w:E_ùR+ and the problem is to find a stable solution. A solution is a matching M with a vector p.RV that satisfies pu+pv=w(uv) for all uv.M and pu=0 for all u unmatched in M. A solution is stable if it...

Persistent link: https://www.econbiz.de/10010494512

Solutions for the Stable Roommates Problem with Payments

Biro, Peter; Bomhoff, Matthijs; Kern, Walter; Golovach, … - Közgazdaság-tudományi Intézet, Közgazdaság- és … - 2012

Persistent link: https://www.econbiz.de/10011070719

Computing Solutions for Matching Games

Biró, Péter; Kern, Walter; Paulusma, Daniël - 2011

A matching game is a cooperative game (N; v) defined on a graph G = (N;E) with an edge weighting w : E ! R+. The player …. First we present an O(nm+n2 log n) algorithm that tests if the core of a matching game defined on a weighted graph with n … with payments. Second we show that the nucleolus of an n-player matching game with a nonempty core can be computed in O(n4 …

Persistent link: https://www.econbiz.de/10010494480

Computing Solutions for Matching Games

Biro, Peter; Kern, Walter; Paulusma, Daniel - Közgazdaság-tudományi Intézet, Közgazdaság- és … - 2011

A matching game is a cooperative game (N; v) defined on a graph G = (N;E) with an edge weighting w : E ! R+. The player … we present an O(nm+n2 log n) algorithm that tests if the core of a matching game defined on a weighted graph with n … with payments. Second we show that the nucleolus of an n-player matching game with a nonempty core can be computed in O(n4 …

Persistent link: https://www.econbiz.de/10010551502

Social Norms and Cooperation in the Matching Game : A Review

Wicaksono, Teguh Yudo - East Asian Bureau of Economic Research (EABER) - 2008

under the random matching game, particularly a seminal work by Kandori. This paper will discuss basic properties of the …

Persistent link: https://www.econbiz.de/10009363655

Categorization and correlation in a random-matching game

Azrieli, Yaron - Volkswirtschaftliche Fakultät, … - 2007

We consider a random-matching model in which every agent has a categorization (partition) of his potential opponents. In equilibrium, the strategy of each player is a best response to the distribution of actions of his opponents in each category of his categorization. We provide equivalence...

Persistent link: https://www.econbiz.de/10005837081