Tommy Andersson

Tommy Andersson

Auto-generated profile, based on publicly available information

Tommy Andersson

Department of Economics, Lund University, Lund, Sweden

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2014 in Econometrica
Verified
Journal Article
Closed access
PDF file
TATommy Andersson
Tommy Andersson
LSLars‐Gunnar Svensson
Lars‐Gunnar Svensson

1 September 2014 in Theoretical Economics
Verified
Journal Article
Open access
PDF file
TATommy Andersson
Tommy Andersson
LELars Ehlers
Lars Ehlers
LSLars-Gunnar Svensson
Lars-Gunnar Svensson
A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount of money among a group of agents. Fairness requires that each agent weakly prefers his consumption bundle to any other agent's bundle. In this context, fairness is incompatible with budget-balance and non-manipulability (Green and Laffont, 1979). Our approach here is to weaken or abandon non-manipulability. We search for the rules which are minimally manipulable among all fair and budget-balanced rules. First, we show for a given preference profile, all fair and budget-balanced rules are either (all) manipulable or (all) non-manipulable. Hence, measures based on counting profiles where a rule is manipulable or considering a possible inclusion of profiles where rules are manipulable do not distinguish fair and budget-balanced rules. Thus, a ``finer'' measure is needed. Our new concept compares two rules with respect to their degree of manipulability by counting for each profile the number of agents who can manipulate the rule. Second, we show that maximally preferred fair allocation rules are the minimally (individually and coalitionally) manipulable fair and budget-balanced allocation rules according to our new concept. Such rules choose allocations with the maximal number of agents for whom the utility is maximized among all fair and budget-balanced allocations

16 October 2023 in Transplantation Direct
Verified
Journal Article
Open access
IWIlse Bsc Duus Weinreich
Ilse Bsc Duus Weinreich
TATommy Andersson
Tommy Andersson
MAMargrét Birna Andrésdóttir
Margrét Birna Andrésdóttir
MBMats Bengtsson
Mats Bengtsson
ABAlireza Biglarnia
Alireza Biglarnia
PLPer Lindnér
Per Lindnér
Background.: Kidney transplant candidates may be incompatible with their intended living donors because of the presence of antibodies against HLA and/or ABO. To increase the possibility of finding an acceptable kidney donor for these patients, the Scandiatransplant Exchange Program (STEP) program within Scandiatransplant was launched in 2019. Methods.: This is a retrospective review of our experiences from the first 4 y of the STEP program, including details about the match runs, performed transplantations, and recipient outcomes within the program. Results.: During 2019–2022, 11 match runs and 4 reruns were performed. In total, 114 pairs and 6 anonymous donors participated in these match runs. Fifty-one pairs (45%) participated in 1 match run, 31 pairs (27%) participated in 2 match runs, and 32 pairs (29%) participated in ≥3 match runs. Seventy-two individuals (63%) participated because of HLA incompatibility, 19 (17%) because of ABO incompatibility, and 7 (6%) because of both HLA and ABO incompatibility. Forty percent of the patients enrolled in the program underwent transplantation. In total, 49 transplantations have so far been performed within the program, and 46 (94%) of the recipients had a functioning kidney graft at follow-up in February 2023. Conclusions.: The STEP program offers sensitized patients an enlarged pool of living donors and a chance of a compatible international living donor, resulting in an increased number of total transplantations. Currently, STEP is one of the largest transnational kidney exchange programs and has improved the situation for patients waiting for kidney transplantation in Scandiatransplant.

16 March 2013 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
TAT. Andersson
T. Andersson
CAC. Andersson
C. Andersson
ATA. J. J. Talman
A. J. J. Talman

30 November 2008 in Mathematical Social Sciences
Verified
Journal Article
Closed access
TATommy Andersson
Tommy Andersson
LSLars-Gunnar Svensson
Lars-Gunnar Svensson

31 July 2005 in Economics Letters
Verified
Journal Article
Closed access
TATommy Andersson
Tommy Andersson