Linearized formulations for failure aware barter exchange

DOI10.1007/S11590-021-01778-1zbMATH Open1491.90173OpenAlexW3181743775MaRDI QIDQ2128774FDOQ2128774

Authors: Noam Goldberg, Michael Poss 

Publication date: 22 April 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01778-1

Recommendations

• Formal specification of multi-agent e-barter systems
• scientific article; zbMATH DE number 6494101
• A formal model of fair exchange protocols
• scientific article; zbMATH DE number 2088914
• Efficient dynamic barter exchange
• Randomized assignments for barter exchanges: fairness vs. efficiency
• Optimality of barter steady states

zbMATH Keywords

MILPlongest pathkidney exchangeclearing algorithmsfailure aware barter exchangelayered formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Cites Work

• JuMP: a modeling language for mathematical optimization
• Title not available (Why is that?)
• New insights on integer-programming models for the kidney exchange problem
• Integer programming formulations for the elementary shortest path problem
• Maximising expectation of the number of transplants in kidney exchange programmes
• Robust Models for the Kidney Exchange Problem
• Layered graph approaches for combinatorial optimization problems
• On the complexity and approximation of the maximum expected value all-or-nothing subset
• Maximum probabilistic all-or-nothing paths

Cited In (1)

• Title not available (Why is that?)

Uses Software

• PrefLib
• JuMP
• GitHub

This page was built for publication: Linearized formulations for failure aware barter exchange

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128774)