Tamás Solymosi
Personal Details
First Name: Tamás
Middle Name:
Last Name: Solymosi
Suffix:
RePEc Short-ID: pso122
Email: [This author has chosen not to make the email address public]
Homepage:
Postal Address:
Phone:
Affiliation
- Budapesti Corvinus Egyetem
- Location: Budapest, Hungary
Homepage: http://www.bkae.hu/
Email:
Phone:
Fax:
Postal: 1093 Budapest, Fővám tér 8
Handle: RePEc:edi:bkeeehu (more details at EDIRC)
Works
Working papers
- Velzen, S. van & Hamers, H.J.M. & Solymosi, T., 2004.
"Core Stability in Chain-Component Additive Games,"
Discussion Paper
2004-101, Tilburg University, Center for Economic Research.
- van Velzen, Bas & Hamers, Herbert & Solymosi, Tamas, 2008. "Core stability in chain-component additive games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 116-139, January.
- Brânzei, R. & Solymosi, T. & Tijs, S.H., 2003.
"Strongly Essential Coalitions and the Nucleolus of Peer Group Games,"
Discussion Paper
2003-19, Tilburg University, Center for Economic Research.
- Rodica Brânzei & Tamás Solymosi & Stef Tijs, 2005. "Strongly essential coalitions and the nucleolus of peer group games," International Journal of Game Theory, Springer, vol. 33(3), pages 447-460, 09.
- Solymosi, T. & Raghavan, T.E.S. & Tijs, S.H., 2003. "Bargaining sets and the core in permutation games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-121823, Tilburg University.
- Brânzei, R. & Solymosi, T. & Tijs, S.H., 2003.
"Type Monotonic Allocation Schemes for Multi-Glove Games,"
Discussion Paper
2003-34, Tilburg University, Center for Economic Research.
- Brânzei, R. & Solymosi, T. & Tijs, S.H., 2007. "Type monotonic allocation schemes for multi-glove games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-195190, Tilburg University.
- Hamers, H.J.M. & Klijn, F. & Solymosi, T. & Tijs, S.H. & Pere Villar, J., 2002.
"Assignment games satisfy the CoMa property,"
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-91410, Tilburg University.
- Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Pere Villar, Joan, 2002. "Assignment Games Satisfy the CoMa-Property," Games and Economic Behavior, Elsevier, vol. 38(2), pages 231-239, February.
- Klijn, F. & Vermeulen, D. & Hamers, H.J.M. & Solymosi, T. & Tijs, S.H. & Pere Villar, J., 1999.
"Neighbour Games and the Leximax Solution,"
Discussion Paper
1999-110, Tilburg University, Center for Economic Research.
- Klijn, Flip & Vermeulen, Dries & Hamers, Herbert & Solymosi, Tamas & Tijs, Stef, 2003. "Neighbor games and the leximax solution," Open Access publications from Maastricht University urn:nbn:nl:ui:27-3972, Maastricht University.
- 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.
- Hamers, H.J.M. & Klijn, F. & Solymosi, T. & Tijs, S.H. & Vermeulen, D., 1999.
"On the Nucleolus of Neighbour Games,"
Discussion Paper
1999-111, Tilburg University, Center for Economic Research.
- 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.
- Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Vermeulen, Dries, 2003. "On the nucleolus of neighbor games," Open Access publications from Maastricht University urn:nbn:nl:ui:27-3951, Maastricht University.
Articles
- van Velzen, Bas & Hamers, Herbert & Solymosi, Tamas, 2008.
"Core stability in chain-component additive games,"
Games and Economic Behavior,
Elsevier, vol. 62(1), pages 116-139, January.
- Velzen, S. van & Hamers, H.J.M. & Solymosi, T., 2004. "Core Stability in Chain-Component Additive Games," Discussion Paper 2004-101, Tilburg University, Center for Economic Research.
- Tamás Solymosi, 2008. "Bargaining sets and the core in partitioning games," Central European Journal of Operations Research, Springer, vol. 16(4), pages 425-440, December.
- Rodica Brânzei & Tamás Solymosi & Stef Tijs, 2007. "Type monotonic allocation schemes for a class of market games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 15(1), pages 78-88, July.
- 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.
- Rodica Brânzei & Tamás Solymosi & Stef Tijs, 2005.
"Strongly essential coalitions and the nucleolus of peer group games,"
International Journal of Game Theory,
Springer, vol. 33(3), pages 447-460, 09.
- Brânzei, R. & Solymosi, T. & Tijs, S.H., 2003. "Strongly Essential Coalitions and the Nucleolus of Peer Group Games," Discussion Paper 2003-19, Tilburg University, Center for Economic Research.
- 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.
- Hamers, H.J.M. & Klijn, F. & Solymosi, T. & Tijs, S.H. & Vermeulen, D., 1999. "On the Nucleolus of Neighbour Games," Discussion Paper 1999-111, Tilburg University, Center for Economic Research.
- Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Vermeulen, Dries, 2003. "On the nucleolus of neighbor games," Open Access publications from Maastricht University urn:nbn:nl:ui:27-3951, Maastricht University.
- Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Pere Villar, Joan, 2002.
"Assignment Games Satisfy the CoMa-Property,"
Games and Economic Behavior,
Elsevier, vol. 38(2), pages 231-239, February.
- Hamers, H.J.M. & Klijn, F. & Solymosi, T. & Tijs, S.H. & Pere Villar, J., 2002. "Assignment games satisfy the CoMa property," Open Access publications from Tilburg University urn:nbn:nl:ui:12-91410, Tilburg University.
- Tamás Solymosi, 2002. "The bargaining set of four-person balanced games," International Journal of Game Theory, Springer, vol. 31(1), pages 1-11.
- T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer, vol. 30(2), pages 177-185.
- TamÂs Solymosi, 1999. "On the bargaining set, kernel and core of superadditive games," International Journal of Game Theory, Springer, vol. 28(2), pages 229-240.
- Solymosi, Tamas & Raghavan, Tirukkannamangai E S, 1994. "An Algorithm for Finding the Nucleolus of Asignment Games," International Journal of Game Theory, Springer, vol. 23(2), pages 119-43.
- Solymosi, Tamas & Dombi, Jozsef, 1986. "A method for determining the weights of criteria: The centralized weights," European Journal of Operational Research, Elsevier, vol. 26(1), pages 35-41, July.
NEP Fields
6 papers by this author were announced in NEP, and specifically in the following field reports (number of papers):- NEP-GTH: Game Theory (5) 1999-07-28 1999-12-21 1999-12-21 2003-03-25 2003-04-27. Author is listed
- NEP-IND: Industrial Organization (2) 1999-12-21 1999-12-21. Author is listed
Statistics
Most cited item
- T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer, vol. 30(2), pages 177-185.
Most downloaded item (past 12 months)
- T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer, vol. 30(2), pages 177-185.
Access and download statistics for all items
Co-authorship network on CollEc
Corrections
To update listings or check citations waiting for approval, Tamás Solymosi should log into the RePEc Author ServiceTo make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.
To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.
Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

