default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Solymosi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Tamás Solymosi
:
Assignment games with population monotonic allocation schemes. Soc. Choice Welf. 62(1): 67-88 (2024)- [i3]Ata Atay, Marina Núñez, Tamás Solymosi:
A many-to-one job market: more about the core and the competitive salaries. CoRR abs/2404.04847 (2024) - 2023
- [j21]Ata Atay, Eric Bahel, Tamás Solymosi:
Matching markets with middlemen under transferable utility. Ann. Oper. Res. 322(2): 539-563 (2023) - [j20]Tamás Solymosi:
Sensitivity of fair prices in assignment markets. Math. Soc. Sci. 126: 1-12 (2023) - 2022
- [j19]Péter Csóka, Ferenc Illés, Tamás Solymosi:
On the Shapley value of liability games. Eur. J. Oper. Res. 300(1): 378-386 (2022) - [i2]Tamás Solymosi:
Assignment games with population monotonic allocation schemes. CoRR abs/2210.17373 (2022) - 2021
- [i1]Ata Atay, Eric Bahel, Tamás Solymosi:
Matching markets with middlemen under transferable utility. CoRR abs/2109.05456 (2021)
2010 – 2019
- 2019
- [j18]Vito Fragnelli, Stefano Moretti, Tamás Solymosi:
Introduction. IGTR 21(1): 1902001:1-1902001:3 (2019) - [j17]Tamás Solymosi:
Weighted nucleoli and dually essential coalitions. Int. J. Game Theory 48(4): 1087-1109 (2019) - 2017
- [j16]Marina Núñez, Tamás Solymosi:
Lexicographic allocations and extreme core payoffs: the case of assignment games. Ann. Oper. Res. 254(1-2): 211-234 (2017) - [j15]Balázs R. Sziklai, Tamás Fleiner, Tamás Solymosi:
On the core and nucleolus of directed acyclic graph games. Math. Program. 163(1-2): 243-271 (2017) - 2016
- [j14]Tamás Solymosi, Balázs R. Sziklai:
Characterization sets for the nucleolus in balanced games. Oper. Res. Lett. 44(4): 520-524 (2016) - 2015
- [j13]Tamás Solymosi:
The kernel is in the least core for permutation games. Central Eur. J. Oper. Res. 23(4): 795-809 (2015)
2000 – 2009
- 2008
- [j12]Tamás Solymosi:
Bargaining sets and the core in partitioning games. Central Eur. J. Oper. Res. 16(4): 425-440 (2008) - [j11]Bas van Velzen, Herbert Hamers, Tamás Solymosi:
Core stability in chain-component additive games. Games Econ. Behav. 62(1): 116-139 (2008) - 2005
- [j10]Tamás Solymosi, T. E. S. Raghavan, Stef Tijs:
Computing the nucleolus of cyclic permutation games. Eur. J. Oper. Res. 162(1): 270-280 (2005) - [j9]Rodica Branzei, Tamás Solymosi, Stef Tijs:
Strongly essential coalitions and the nucleolus of peer group games. Int. J. Game Theory 33(3): 447-460 (2005) - 2003
- [j8]Herbert Hamers, Flip Klijn, Tamás Solymosi, Stef Tijs, Dries Vermeulen:
On the nucleolus of neighbor games. Eur. J. Oper. Res. 146(1): 1-18 (2003) - [j7]Flip Klijn, Dries Vermeulen, Herbert Hamers, Tamás Solymosi, Stef Tijs, Joan Pere Villar:
Neighbor games and the leximax solution. Math. Methods Oper. Res. 58(2): 191-208 (2003) - 2002
- [j6]Herbert Hamers, Flip Klijn, Tamás Solymosi, Stef Tijs, Joan Pere Villar:
Assignment Games Satisfy the CoMa-Property. Games Econ. Behav. 38(2): 231-239 (2002) - [j5]Tamás Solymosi:
The bargaining set of four-person balanced games. Int. J. Game Theory 31(1): 1-11 (2002) - 2001
- [j4]Tamás Solymosi, T. E. S. Raghavan:
Assignment games with stable core. Int. J. Game Theory 30(2): 177-185 (2001) - 2000
- [j3]Jeroen Kuipers, Tamás Solymosi, Harry Aarts:
Computing the nucleolus of some combinatorially-structured games. Math. Program. 88(3): 541-563 (2000)
1990 – 1999
- 1999
- [j2]Tamás Solymosi:
On the bargaining set, kernel and core of superadditive games. Int. J. Game Theory 28(2): 229-240 (1999) - 1998
- [j1]Tamás Solymosi, Harry Aarts, Theo Driessen:
On Computing the Nucleolus of a Balanced Connected Game. Math. Oper. Res. 23(4): 983-1009 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
