Interim agreements

Abstract Processes of bargaining are studied in which the players reach interim agreements that serve as status quo points for further bargaining. This is modeled in Nash’s setup of bargaining problems, where the solution is a time parameterized path of interim agreements rather than a single point. We characterize path solutions for linear problems that satisfy the axioms of restarting and covariance , and show that if a Pareto efficient agreement is not reached immediately, then it is never reached in finite time. Adding the axioms of individual rationality , relevance , and monotonicity , we characterize the family of continuous Raiffa solutions and show that these solutions converge to a Pareto efficient agreement but never reach it in finite time. Finally, if a deadline is added to the bargaining problem, and the speed of bargaining is proportionally inverse to the deadline, then a Pareto efficient agreement is reached exactly at the deadline.

Authors

Institutions

Publication Details

Journal
International Journal of Game Theory
Published
2026-05-22
DOI
https://doi.org/10.1007/s00182-026-00996-0
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Interim agreements

Dov Samet
International Journal of Game Theory
Game Theory and Voting Systems
article

Interim agreements

Dov Samet
article en

Abstract

Abstract Processes of bargaining are studied in which the players reach interim agreements that serve as status quo points for further bargaining. This is modeled in Nash’s setup of bargaining problems, where the solution is a time parameterized path of interim agreements rather than a single point. We characterize path solutions for linear problems that satisfy the axioms of restarting and covariance , and show that if a Pareto efficient agreement is not reached immediately, then it is never reached in finite time. Adding the axioms of individual rationality , relevance , and monotonicity , we characterize the family of continuous Raiffa solutions and show that these solutions converge to a Pareto efficient agreement but never reach it in finite time. Finally, if a deadline is added to the bargaining problem, and the speed of bargaining is proportionally inverse to the deadline, then a Pareto efficient agreement is reached exactly at the deadline.

International Journal of Game TheoryVol. 55(1)
Tel Aviv University (IL)
Tel Aviv University
Openalex Percentile: Top 3%
Game Theory and Voting Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.