Advanced Search
MyIDEAS: Login

An Algorithm for Finding the Nucleolus of Asignment Games

Contents:

Author Info

  • Solymosi, Tamas
  • Raghavan, Tirukkannamangai E S

Abstract

No abstract is available for this item.

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Bibliographic Info

Article provided by Springer in its journal International Journal of Game Theory.

Volume (Year): 23 (1994)
Issue (Month): 2 ()
Pages: 119-43

as in new window
Handle: RePEc:spr:jogath:v:23:y:1994:i:2:p:119-43

Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00182/index.htm

Order Information:
Web: http://link.springer.de/orders.htm

Related research

Keywords:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Peter Biro & Walter Kern & Daniel Paulusma, 2011. "Computing Solutions for Matching Games," IEHAS Discussion Papers 1142, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
  2. Silvia Miquel & Bas Van Velzen & Herbert Hamers & Henk Norde, 2009. "Assignment Situations With Multiple Ownership And Their Games," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 11(01), pages 1-13.
  3. S. Miquel & M. Núñez, 2011. "The maximum and the addition of assignment games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 19(1), pages 189-212, July.
  4. Francesc Llerena & Marina Nunez, 2011. "A geometric characterization of the nucleolus of the assignment game," Economics Bulletin, AccessEcon, vol. 31(4), pages 3275-3285.
  5. Kuipers, Jeroen & Mosquera, Manuel A. & Zarzuelo, José M., 2013. "Sharing costs in highways: A game theoretic approach," European Journal of Operational Research, Elsevier, vol. 228(1), pages 158-168.
  6. Marina Núñez & Carles Rafels, 2006. "A Canonical Representation for the Assignment Game: the Kernel and the Nucleolus," Working Papers 279, Barcelona Graduate School of Economics.
  7. Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Vermeulen, Dries, 2003. "On the nucleolus of neighbor games," European Journal of Operational Research, Elsevier, vol. 146(1), pages 1-18, April.
  8. Sankaran, J. K., 1998. "On a variant of lexicographic multi-objective programming," European Journal of Operational Research, Elsevier, vol. 107(3), pages 669-674, June.
  9. Francesc Llerena (Universitat Rovira i Virgili - CREIP) & Marina Nunez (Universitat de Barcelona) & Carles Rafels (Universitat de Barcelona), 2012. "An axiomatization of the nucleolus of the assignment game," Working Papers in Economics 286, Universitat de Barcelona. Espai de Recerca en Economia.
  10. Solymosi, Tamas & Raghavan, T. E. S. & Tijs, Stef, 2005. "Computing the nucleolus of cyclic permutation games," European Journal of Operational Research, Elsevier, vol. 162(1), pages 270-280, April.
  11. F. Javier Martínez-de-Albéniz & Carles Rafels & Neus Ybern, 2013. "On the nucleolus of 2 x 2 assignment games," Economics Bulletin, AccessEcon, vol. 33(2), pages 1641-1648.
  12. Núñez, Marina & Rafels, Carles, 2008. "On the dimension of the core of the assignment game," Games and Economic Behavior, Elsevier, vol. 64(1), pages 290-302, September.
  13. Oriol Tejada & Marina Núñez, 2012. "The nucleolus and the core-center of multi-sided Böhm-Bawerk assignment markets," Computational Statistics, Springer, vol. 75(2), pages 199-220, April.
  14. Martínez-de-Albéniz, F. Javier & Núñez, Marina & Rafels, Carles, 2011. "Assignment markets with the same core," Games and Economic Behavior, Elsevier, vol. 73(2), pages 553-563.
  15. Balazs Sziklai & Tamas Fleiner & Tamas Solymosi, 2013. "The Nucleolus of Directed Acyclic Graph Games," IEHAS Discussion Papers 1321, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
  16. Hamers, H.J.M. & Klijn, F. & Solymosi, T. & Tijs, S.H. & Pere Villar, J., 1999. "On the extreme points of the core of neighbour games and assignment games," Discussion Paper 1999-43, Tilburg University, Center for Economic Research.
  17. Llerena Garrés, Francesc & Nuñez, Marina (Núñez Oliva), 2014. "Axiomatization of the nucl eolus of assignment games," Working Papers 2072/228403, Universitat Rovira i Virgili, Department of Economics.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:23:y:1994:i:2:p:119-43. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.