A Solution to Bargaining Problem on Divisible Goods
Computer Science and Game Theory
2014-03-04 v1
Abstract
Two-person bargaining problem is considered as to allocate a number of goods between two players. This paper suggests that any non-trivial division of goods cause a non-zero change on the solution of bargaining. So, a axiom of sharing division is presented, as an alternative axiom to Nash axiom of independence of irrelevant alternatives and Kalai-Smorodinsky axiom of monotonicity. This solution is targeted at the partialities of Nash and Kalai-Smorodinsky solution on some specific issues, but not to say it is better than others.
Keywords
Cite
@article{arxiv.1403.0162,
title = {A Solution to Bargaining Problem on Divisible Goods},
author = {Xuegong Deng},
journal= {arXiv preprint arXiv:1403.0162},
year = {2014}
}