30 research outputs found

    A game theoretic framework for bandwidth allocation and pricing in broadband networks

    Full text link

    Multiple unusual urological locations of hydatic cysts including kidney, retrovesical and spermatic cord. A new case report

    No full text
    Human hydatidosis is endemic in regions with temperate climate where pastoral farming is common.It is frequent in the southern shore of the Mediterranean, particularly in the Maghreb countries. It remains asymptomatic for long period, and the diagnosis is often delayed. The most affected organs are the liver and lungs. Hydatic disease of the urinary tract is an unusual entity.Our case concerns multiple unusual locations of hydatic disease in the urinary tract, including renal, retrovesical and spermatic cord, associated with splenic and intraperitoneal locations. Coexistence of hydatic cysts in such locations of urinary tract has not been previously reported

    A Nash bargaining solution for Cooperative Network Formation Games

    Get PDF
    The Network Formation problem has received increasing attention in recent years. Previous works have addressed this problem considering almost exclusively networks designed by selfish users, which can be consistently suboptimal. This paper addresses the network formation issue using cooperative game theory, which permits to study ways to enforce and sustain cooperation among agents. Both the Nash bargaining solution and the Shapley value are widely applicable concepts for solving these games. However, we show that the Shapley value presents three main drawbacks in this context: (1) it is non-trivial to define meaningful characteristic functions for the cooperative network formation game, (2) it can determine for some players cost allocations that are even higher than those at the Nash Equilibrium (i.e., if players refuse to cooperate), and (3) it is computationally very cumbersome. For this reason, we solve the cooperative network formation game using the Nash bargaining solution (NBS) concept. More specifically, we extend the NBS approach to the case of multiple players and give an explicit expression for users ’ cost allocations. Furthermore, we compare the NBS to the Shapley value and the Nash equilibrium solution, showing its advantages and appealing properties in terms of cost allocation to users and computation time to get the solution. Numerical results demonstrate that the proposed Nash bargaining solution approach permits to allocate costs fairly to users in a reasonable computation time, thus representing a very effective framework for the design of efficient and stable networks
    corecore