IDEAS home Printed from https://ideas.repec.org
 

IDEAS/RePEc search

Found 533 results for '"Nucleolus"', showing 1-10
IDEAS search now includes synonyms. If you feel that some synonyms are missing, you are welcome to suggest them for inclusion

  1. A. Estévez-Fernández & P. Borm & M. G. Fiestras-Janeiro & M. A. Mosquera & E. Sánchez-Rodríguez (2017): On the 1-nucleolus
    This paper analyzes the 1-nucleolus and, in particular, its relation to the nucleolus. It is seen that, contrary to the nucleolus, the 1-nucleolus can be computed in polynomial time due to a characterization using a combination of standard bankruptcy rules for associated bankruptcy problems. Sufficient conditions on a compromise stable game are derived such that the 1-nucleolus and the nucleolus coincide.
    RePEc:spr:mathme:v:86:y:2017:i:2:d:10.1007_s00186-017-0597-x  Save to MyIDEAS
  2. Elena Iñarra & Roberto Serrano & Ken-Ichi Shimomura (2020): The Nucleolus, the Kernel, and the Bargaining Set: An Update
    s distinguished career was the introduction of the nucleolus. This paper is an update on the nucleolus and its two related supersolutions, i.e., the kernel and the bargaining set.
    RePEc:cai:recosp:reco_712_0225  Save to MyIDEAS
  3. Elena Iñarra & Roberto Serrano & Ken-Ichi Shimomura (2019): The Nucleolus, the Kernel, and the Bargaining Set: An Update
    One of the many important contributions in David Schmeidler's distinguished career was the introduction of the nucleolus. This paper is an update on the nucleolus and its two related supersolutions, i.e., the kernel and the bargaining set.
    RePEc:kob:dpaper:dp2019-12  Save to MyIDEAS
  4. Iñarra García, María Elena & Serrano, Roberto & Shimomura, Ken-Ichi (2019): The Nucleolus, the Kernel, and the Bargaining Set: An Update
    This paper is an updated survey on the nucleolus and its two related supersolutions, i.e., the kernel and the bargaining set. ... The nucleolus has a number of desirable properties, including nonemptiness, uniqueness, core selection, and consistency. ... Indeed, if one likes a single-valued version of core stability that always yields a prediction, one should consider the nucleolus as a recommendation. The kernel, which contains the nucleolus, is based on the idea of “bilateral equilibrium” for every pair of players. ... In this paper, section 2 presents preliminaries, section 3 is devoted to the nucleolus, section 4 to the kernel, and section 5 to the bargaining set.
    RePEc:ehu:ikerla:34464  Save to MyIDEAS
  5. F.Javier Martínez-de-Albéniz & Carles Rafels & Neus Ybern (2015): Insights into the nucleolus of the assignment game
    We show that the family of assignment matrices which give rise to the same nucleolus form a compact join-semilattice with one maximal element, which is always a valuation (see p.43, Topkis (1998)). ... We also analyze the conditions to ensure that a given vector is the nucleolus of some assignment game.
    RePEc:ewp:wpaper:333web  Save to MyIDEAS
  6. Jeroen Kuipers & Ulrich Faigle & Walter Kern (1998): Note Computing the nucleolus of min-cost spanning tree games is NP-hard
    We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard.
    RePEc:spr:jogath:v:27:y:1998:i:3:p:443-450  Save to MyIDEAS
  7. Mikel ÁLVAREZ-MOZOS & Lars EHLERS (2017): Externalities and the Nucleolus
    We show that there is a unique natural way of extending the nucleolus from (coalitional) games without externalities to games with externalities.
    RePEc:mtl:montec:08-2017  Save to MyIDEAS
  8. ALVAREZ-MOZOS, Mikel & EHLERS, Lars (2017): Externalities and the nucleolus
    We show that there is a unique natural way of extending the nucleolus from (coalitional) games without externalities to games with externalities.
    RePEc:mtl:montde:2017-04  Save to MyIDEAS
  9. M. Meertens & J. Potters (2006): The nucleolus of trees with revenues
    In this paper, we present an algorithm for calculating the nucleolus.
    RePEc:spr:mathme:v:64:y:2006:i:2:p:363-382  Save to MyIDEAS
  10. Hamers, H.J.M. & Klijn, F. & Solymosi, T. & Tijs, S.H. & Vermeulen, D. (1999): On the Nucleolus of Neighbour Games
    For assignment games and component additive games there exist polynomially bounded algorithms of order p4 for calculating the nucleolus, where p is the number of players. In this paper we present a polynomially bounded algorithm of order p2 for calculating the nucleolus of neighbour games.
    RePEc:tiu:tiucen:24d16e9c-4dab-4284-8b39-f21cd2a39d03  Save to MyIDEAS
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.
;