This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...