Tamás Solymosi

According to our database, Tamás Solymosi authored at least 24 papers between 1998 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

A note on the non-coincidence of the core and the bargaining set in many-to-one assignment markets.

Ata Atay, Marina Núñez, Tamás Solymosi

Games Econ. Behav., 2026

2024

Assignment games with population monotonic allocation schemes.

Tamás Solymosi

Soc. Choice Welf., February, 2024

A many-to-one job market: more about the core and the competitive salaries.

Ata Atay, Marina Núñez, Tamás Solymosi

CoRR, 2024

2023

Matching markets with middlemen under transferable utility.

Ata Atay, Eric Bahel, Tamás Solymosi

Ann. Oper. Res., March, 2023

Sensitivity of fair prices in assignment markets.

Tamás Solymosi

Math. Soc. Sci., 2023

2022

On the Shapley value of liability games.

Péter Csóka, Ferenc Illés, Tamás Solymosi

Eur. J. Oper. Res., 2022

2019

Weighted nucleoli and dually essential coalitions.

Tamás Solymosi

Int. J. Game Theory, 2019

Introduction.

Vito Fragnelli, Stefano Moretti, Tamás Solymosi

IGTR, 2019

2017

On the core and nucleolus of directed acyclic graph games.

Balázs R. Sziklai, Tamás Fleiner, Tamás Solymosi

Math. Program., 2017

Lexicographic allocations and extreme core payoffs: the case of assignment games.

Marina Núñez, Tamás Solymosi

Ann. Oper. Res., 2017

2016

Characterization sets for the nucleolus in balanced games.

Tamás Solymosi, Balázs R. Sziklai

Oper. Res. Lett., 2016

2015

The kernel is in the least core for permutation games.

Tamás Solymosi

Central Eur. J. Oper. Res., 2015

2008

Core stability in chain-component additive games.

Bas van Velzen, Herbert Hamers, Tamás Solymosi

Games Econ. Behav., 2008

Bargaining sets and the core in partitioning games.

Tamás Solymosi

Central Eur. J. Oper. Res., 2008

2005

Strongly essential coalitions and the nucleolus of peer group games.

Rodica Branzei, Tamás Solymosi, Stef Tijs

Int. J. Game Theory, 2005

Computing the nucleolus of cyclic permutation games.

Tamás Solymosi, T. E. S. Raghavan, Stef Tijs

Eur. J. Oper. Res., 2005

2003

Neighbor games and the leximax solution.

Flip Klijn, Dries Vermeulen, Herbert Hamers, Tamás Solymosi, Stef Tijs, Joan Pere Villar

Math. Methods Oper. Res., 2003

On the nucleolus of neighbor games.

Herbert Hamers, Flip Klijn, Tamás Solymosi, Stef Tijs, Dries Vermeulen

Eur. J. Oper. Res., 2003

2002

The bargaining set of four-person balanced games.

Tamás Solymosi

Int. J. Game Theory, 2002

Assignment Games Satisfy the CoMa-Property.

Herbert Hamers, Flip Klijn, Tamás Solymosi, Stef Tijs, Joan Pere Villar

Games Econ. Behav., 2002

2001

Assignment games with stable core.

Tamás Solymosi, T. E. S. Raghavan

Int. J. Game Theory, 2001

2000

Computing the nucleolus of some combinatorially-structured games.

Jeroen Kuipers, Tamás Solymosi, Harry Aarts

Math. Program., 2000

1999

On the bargaining set, kernel and core of superadditive games.

Tamás Solymosi

Int. J. Game Theory, 1999

1998

On Computing the Nucleolus of a Balanced Connected Game.

Tamás Solymosi, Harry Aarts, Theo Driessen

Math. Oper. Res., 1998