A Two-Person Conflict Model in Train Scheduling

DOI10.1142/S0219198903000921MaRDI QIDQ4474566zbMATH OpenFDO

Authors Keivan Ghoseiri, F. Szidarovszky, Mohammad Jawad Asgharpour

Publication date 12 July 2004

Published in International Game Theory Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219198903000921

zbMATH Keywords

area monotonic solutionequal loss solutionKalai-Smorodinsky solutionnon-symmetric Nash solutionone-shot solution conceptPareto frontier

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) 2-person games (91A05) Cooperative games (91A12)

Recommendations

• Bicriteria train scheduling for high-speed passenger railroad planning applications
• scientific article; zbMATH DE number 2042677
• scientific article; zbMATH DE number 446516
• Cost optimal allocation of rail passenger lines
• A fast heuristic for the train scheduling problem

Cites work

• A Generalized Nash Solution for Two-Person Bargaining Games with Incomplete Information
• A STOCHASTIC BARGAINING PROCESS AND CORRESPONDING ONE-SHOT SOLUTION CONCEPT
• Noncooperative Foundations of the Area Monotonic Solution
• Other Solutions to Nash's Bargaining Problem
• Perfect Equilibrium in a Bargaining Model
• The bargaining problem
• The equal-loss principle for bargaining problems

Cited in

(1)

• Novel multi-objective resource allocation and activity scheduling for fourth party logistics

This page was built for publication: A Two-Person Conflict Model in Train Scheduling

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