DMCA
An Intelligent Agent for Bilateral Negotiation with Unknown Opponents in Continuous-Time Domains
| Citations: | 1 - 0 self |
Citations
| 1326 | Perfect equilibrium in a bargaining model - Rubinstein - 1982 |
| 675 | The Art and Science of Negotiation - Raiffa - 1982 |
| 357 | Negotiation Decision Functions for Autonomous Agents” Int
- Faratin, Sierra, et al.
- 1998
(Show Context)
Citation Context ...hich the agents operate is explained. Second, the regression framework, including Gaussian processes (GPs) and SPGPs, is detailed. 2.1. Negotiation Model In the agents field, a large number of works [=-=Faratin et al. 1998-=-, 2002; Williams et al. 2011; Chen and Weiss 2012; Chen et al. 2013b] adopt the alternating offers protocol formalized in Rubinstein [1982] for bilateral negotiation. During negotiation, the two parti... |
| 297 | Automated negotiation: prospects, methods and challenges
- Jennings, Faratin, et al.
- 2001
(Show Context)
Citation Context ...16 (October 2014), 24 pages. DOI: http://dx.doi.org/10.1145/2629577 1. INTRODUCTION Automated negotiation, as a fundamental and powerful mechanism for managing interaction among computational agents [=-=Jennings et al. 2001-=-], has become a subject of central interest in distributed artificial intelligence over the past years. The main reason behind it is twofold. First, it can support and facilitate human negotiators in ... |
| 229 | Sparse Gaussian processes using pseudoinputs
- Snelson, Ghahramani
- 2006
(Show Context)
Citation Context ...ts further demonstrate that SPGPs can fully match normal GPs with small M (i.e., few pseudoinputs), successfully producing very sparse solutions. A full mathematical treatment may be found elsewhere [=-=Snelson and Ghahramani 2006-=-]. To understand the usefulness and powerfulness of SPGPs in the context of automated negotiation, consider a classical negotiation scenario where two agents negotiate with each other about what kinds... |
| 137 | Using similarity criteria to make issue trade-offs in automated negotiations - Faratin, Sierra, et al. |
| 61 | Negotiating with bounded rational agents in environments with incomplete information using an automated agent - Lin, Kraus, et al. - 2008 |
| 50 | Learning an opponent’s preferences to make effective multi-issue negotiation trade-offs - Coehoorn, Jennings |
| 47 |
The evolution of conventions,” Econometrica
- Young
- 1993
(Show Context)
Citation Context .... 2007] is applied to the tournament results. The aim of using EGT is to search for pure Nash equilibria, in which no agent has an incentive to deviate from its current strategy, or best reply cycle [=-=Young 1993-=-], where there exist a set of profiles (i.e., the combination of strategies chosen by players) for which a path of deviations exists that connect them, with no deviation leading to a profile outside o... |
| 41 |
Spatial evolutionary game theory: Hawks and Doves revisited.
- Killingback, Doebeli
- 1996
(Show Context)
Citation Context ... fitness, use a set of negotiation strategies to compete against each other. To analyze spatial negotiation games, we apply evolutionary game theory— more precisely, spatial evolutionary game theory [=-=Killingback and Doebeli 1996-=-; Szabó and Fáth 2007]—to the tournament results. This allows us to study the impact on fitness (i.e., how well a individual is adapted to a dynamic environment) of each species (strategy) competing... |
| 23 | Benefits of learning in negotiation - Zeng, Sycara - 1997 |
| 20 | Modeling opponent decision in repeated oneshot negotiations - Saha, Biswas, et al. - 2005 |
| 16 | Using gaussian processes to optimise concession in complex negotiations against unknown opponents
- Williams, Robu, et al.
- 2011
(Show Context)
Citation Context ...explained. Second, the regression framework, including Gaussian processes (GPs) and SPGPs, is detailed. 2.1. Negotiation Model In the agents field, a large number of works [Faratin et al. 1998, 2002; =-=Williams et al. 2011-=-; Chen and Weiss 2012; Chen et al. 2013b] adopt the alternating offers protocol formalized in Rubinstein [1982] for bilateral negotiation. During negotiation, the two parties in turn make offers and c... |
| 15 |
Evaluating practical negotiating agents: Results and analysis of the 2011 international competition, Artificial Intelligence 198
- Baarslag, Fujita, et al.
- 2013
(Show Context)
Citation Context ... of a negotiation model is to specify the way in which an agent evaluates the utility of an offer to her. We take a common view from the existing literature [Williams et al. 2011; Hao and Leung 2012; =-=Baarslag et al. 2013-=-; Chen et al. 2013a]. Formally, let i be an agent, j be an issue, and k represent the choice of the jth issue. We define the value of issue j as v jk. The lowest payoff of an agent for a negotiation i... |
| 14 | Negotiation among autonomous computational agents: principles, analysis and challenges,
- Lopes, Wooldridge, et al.
- 2008
(Show Context)
Citation Context ...and G. Weiss applications in industrial and commercial domains is very broad [Adhau et al. 2012; Moosmayer et al. 2013; Sanchez-Anguix et al. 2013]. Various forms of negotiation can be distinguished [=-=Lopes et al. 2008-=-]. This article deals with bilateral multi-issue negotiation. In this setting, two agents negotiate with the goal to agree on a profitable contract for a product or service, where the contract consist... |
| 13 | Predicting opponent’s moves in electronic negotiations using neural networks. Expert Systems with Applications - Carbonneau, Kersten, et al. - 2008 |
| 6 |
An efficient automated negotiation strategy for complex environments
- Chen, Weiss
- 2013
(Show Context)
Citation Context ...). 4.2.2. Results of Advanced Tournament. Figure 3 gives the results of the advanced tournament where only the strongest opponents—the winners of each year’s competition and an additional agent EMAR [=-=Chen and Weiss 2013-=-]—are included. This setting is much more challenging than the former. Due to this fact, the performance of DragonAgent to some extent dropped. It, however, was still ranked first among other contende... |
| 4 |
A multi-agent system for distributed multi-project scheduling: An auction-based negotiation approach
- Adhau, Mittal, et al.
- 2012
(Show Context)
Citation Context ... Transactions on Autonomous and Adaptive Systems, Vol. 9, No. 3, Article 16, Publication date: October 2014. 16:2 S. Chen and G. Weiss applications in industrial and commercial domains is very broad [=-=Adhau et al. 2012-=-; Moosmayer et al. 2013; Sanchez-Anguix et al. 2013]. Various forms of negotiation can be distinguished [Lopes et al. 2008]. This article deals with bilateral multi-issue negotiation. In this setting,... |
| 3 |
A neural network approach to predicting price negotiation outcomes in business-tobusiness contexts. Expert Systems with Applications
- Moosmayer, Chonga, et al.
- 2013
(Show Context)
Citation Context ...he limited computational abilities of humans, especially in complicated negotiations. Second, its spectrum of potential This article is a substantially extended version of our AAMAS main track paper [=-=Chen et al. 2013-=-a]. The extension concerns both the description and evaluation of Dragon. With regard to the description, all relevant aspects of our approach are shown in detail. With regard to the evaluation, the r... |
| 2 | A Survey of Opponent Models in Automated Negotiation - Hendrikx - 2011 |
| 2 | Learning to negotiate optimally in non-stationary environments - Narayanan, Jennings - 2006 |
| 1 |
Optimizing complex automated negotiation using sparse pseudo-input Gaussian processes
- 2013a
(Show Context)
Citation Context ...rmined based on a frequency analysis. Although simple, such a method has been successfully applied by some state-of-the-art negotiating agents, like Hardheaded and CUHKAgent (refer to Baarslag et al. =-=[2013]-=- and Hao and Leung [2012]). In the present work, Dragon considers that the opponent is rational. More precisely, Dragon assumes that the sequence of counteroffers is in line with a decreasing order of... |
| 1 |
Using conditional restricted Boltzmann machine for highly competitive negotiation tasks
- 2013b
(Show Context)
Citation Context ...rmined based on a frequency analysis. Although simple, such a method has been successfully applied by some state-of-the-art negotiating agents, like Hardheaded and CUHKAgent (refer to Baarslag et al. =-=[2013]-=- and Hao and Leung [2012]). In the present work, Dragon considers that the opponent is rational. More precisely, Dragon assumes that the sequence of counteroffers is in line with a decreasing order of... |
| 1 | Dmytro Tykhonov. 2009b. GENIUS: Negotiation environment for heterogeneous agents - Hindriks, Jonker, et al. - 1397 |
| 1 | Dmytro Tykhonov. 2009a. The benefits of opponent models in negotiation - Hindriks, Jonker |
| 1 | Order statistics Bayesian-mining agent modelling for automated negotiation - Rahman, Bahgat, et al. - 2011 |
| 1 | Tasks for agent-based negotiation teams: Analysis, review, and challenges
- Sanchez-Anguix, Julian, et al.
- 2013
(Show Context)
Citation Context ...ystems, Vol. 9, No. 3, Article 16, Publication date: October 2014. 16:2 S. Chen and G. Weiss applications in industrial and commercial domains is very broad [Adhau et al. 2012; Moosmayer et al. 2013; =-=Sanchez-Anguix et al. 2013-=-]. Various forms of negotiation can be distinguished [Lopes et al. 2008]. This article deals with bilateral multi-issue negotiation. In this setting, two agents negotiate with the goal to agree on a p... |
