Bargaining under two-sided incomplete information: the unrestricted offers case
Operations Research
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Multiagent negotiation under time constraints
Artificial Intelligence
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Autonomous Agents and Multi-Agent Systems
An agenda-based framework for multi-issue negotiation
Artificial Intelligence
Computing sequential equilibria for two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding equilibria in large sequential games of imperfect information
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Bargaining over multiple issues in finite horizon alternating-offers protocol
Annals of Mathematics and Artificial Intelligence
Lossless abstraction of imperfect information games
Journal of the ACM (JACM)
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
Artificial Intelligence
Heuristics for negotiation schedules in multi-plan optimization
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Multi-issue negotiation with deadlines
Journal of Artificial Intelligence Research
Bilateral Bargaining with One-Sided Two-Type Uncertainty
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
On efficient procedures for multi-issue negotiation
TADA/AMEC'06 Proceedings of the 2006 AAMAS workshop and TADA/AMEC 2006 conference on Agent-mediated electronic commerce: automated negotiation and strategy design for electronic markets
Automated negotiation with decommitment for dynamic resource allocation in cloud computing
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Strategic agents for multi-resource negotiation
Autonomous Agents and Multi-Agent Systems
Automated negotiation for complex multi-agent resource allocation
Automated negotiation for complex multi-agent resource allocation
Agents that react to changing market situations
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
New results on the verification of Nash refinements for extensive-form games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Hi-index | 0.00 |
The problem of finding agents' rational strategies in bargaining with incomplete information is well known to be challenging. The literature provides a collection of results for very narrow uncertainty settings, but no generally applicable algorithm. This lack has led researchers to develop heuristic approaches in an attempt to find outcomes that, even if not being of equilibrium, are mutually satisfactory. In the present paper, we focus on the principal bargaining protocol (i.e., the alternating-offers protocol) where there is uncertainty regarding one agent's reserve price. We provide an algorithm based on the combination of game theoretic analysis and search techniques which finds pure strategy sequential equilibria when they exist. Our approach is sound, complete and, in principle, can be applied to other uncertainty settings, e.g., uncertain discount factors, and uncertain weights of negotiation issues in multi-issue negotiation. We experimentally evaluate our algorithm with a number of case studies showing that the average computational time is less than 30 s and at least one pure strategy equilibrium exists in almost all (about 99.7 %) the bilateral bargaining scenarios we have looked at in the paper.