Learning about the opponent in automated bilateral negotiation: a comprehensive survey of opponent modeling techniques

A negotiation between agents is typically an incomplete information game, where the agents initially do not know their opponent’s preferences or strategy. This poses a challenge, as efficient and effective negotiation requires the bidding agent to take the other’s wishes and future behavior into account when deciding on a proposal. Therefore, in order to reach better and earlier agreements, an agent can apply learning techniques to construct a model of the opponent. There is a mature body of research in negotiation that focuses on modeling the opponent, but there exists no recent survey of commonly used opponent modeling techniques. This work aims to advance and integrate knowledge of the field by providing a comprehensive survey of currently existing opponent models in a bilateral negotiation setting. We discuss all possible ways opponent modeling has been used to benefit agents so far, and we introduce a taxonomy of currently existing opponent models based on their underlying learning techniques. We also present techniques to measure the success of opponent models and provide guidelines for deciding on the appropriate performance measures for every opponent model type in our taxonomy.     

一对多协商协调策略

重点研究了一对多协商中对多个并发的一对一协商进行协调的协调策略。首先提出了相对效用理论,接着提出了基于相时效用理论的一对多协商协调策略,谊策略能够很好地解决当多个并发协商进程同时获得满足艘用评估的提议,特别是存在多个最大相同效用提议时的取舍问题,为协商更加有效、健壮、有序地执行提供了坚实的基础。     

The Procedures of the CADE-13 ATP System Competition

This article describes the practical procedures that were used to run the CADE-13 ATP System Competition. The article describes the hardware and software environments, the system installation, the soundness testing performed, the preparation of problems for the competition, the choice of the number of problems and the time limit, and the execution of the systems.     

The Design of the CADE-13 ATP System Competition

Running a competition for automated theorem proving (ATP) systems is a difficult and arguable venture. However, the potential benefits of such an event by far outweigh the controversial aspects. The motivations for running the CADE-13 ATP System Competition were to contribute to the evaluation of ATP systems, to stimulate ATP research and system development, and to expose ATP systems to researchers both within and outside the ATP community. This article identifies and discusses the issues that determine the nature of such a competition. Choices and motivated decisions for the CADE-13 competition, with respect to the issues, are given.     

The Results - of the CADE-13 ATP System Competition

The CADE-13 ATP System Competition tested 18 ATP systems on 50 theorems, in five competition categories, with a time limit of 300 seconds imposed on each system run. This article records the results of the competition. Some analysis of these results is given, and interesting points are highlighted.     

Conclusions about the CADE-13 ATP System Competition

The CADE-13 ATP System Competition was the first large-scale controlled competition for first-order ATP systems. Many people have commented on various aspects of the competition, including some suggestions for future improvement. These comments, and some discussion of them, are contained in this article. An overview of the major issues that will affect future competitions is given.     

基于状态演算的通用游戏系统的自动推理

为提高通用游戏系统的自动推理能力,提出了基于状态演算的通用游戏系统的自动推理方法,并将其作为推理模块构建了通用游戏系统模型.利用状态演算逻辑程序设计语言(state calculus executor,STEX)实现通用游戏的状态更新与动作推理,给出了基于状态演算的通用游戏系统模型的功能模块设计,最后利用prolog语言实现了各功能模块,调试系统并进行实例验证.实验结果表明,采用了基于状态演算的自动推理方法,得到较好的游戏成绩,提高了游戏系统的自动推理能力.     

Automatic price negotiation on the web: An agent-based web application using fuzzy expert system

A traditional internet auction is restricted by the limitation of time. It is necessary to conduct an internet auction in a certain time period. The final trading price is determined until this certain period ends. This study improves this situation by removing the time limitation. Based on the fuzzy inference theory, this paper proposes an agent-based price negotiation system for on-line auctions. Mainly, three agents are used in the study: a seller agent, a buyer agent, and a mediator agent. The proposed system provides an easy-to-use environment and good customizability for users (buyers or sellers) to customize their price negotiation strategies using user-defined fuzzy rules. The final negotiated price is immediately determined after the buyer sends his bids to the proposed system. This study develops a Java-based computer package to implement the price negotiation system where Model-View-Controller (MVC) design pattern is employed in design of the package. Unified Modeling Language (UML) is also utilized to describe the structures and behaviors of the package. To validate the proposed system, this study built an on-line auction website with the proposed price negotiation mechanism for internet users to buy or sell their merchandises. An evaluation was finally conducted to investigate the users’ satisfaction with the proposed system.Briefly, the proposed system is featured by: (1) instantly getting negotiated price without waiting; (2) conducting price negotiation at any time; (3) determining strategy rules easily, and (4) using customizable negotiation strategies defined by users.     

绿色电力下的电厂自动化控制系统分析

在绿色电厂中应用自动化控制系统,不仅提高了电厂运行的质量和效率,还在很大程度上促进了绿色电厂的发展。分析了绿色电厂自动化控制系统的应用意义,阐述了自动化控制系统在绿色电厂中的具体应用,并探讨了绿色电厂自动化控制系统的发展前景,以期为相关人员提供参考。     

精炼炉全自动备料的精准控制

介绍精炼炉备料工艺,针对备料存在的问题,提出分段PID控制、基于BP神经网络的自学习控制和速度突变的应急控制等改进方法.     

Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset

Real-time systems are becoming increasingly widespread, often in safety-critical applications. It is therefore crucial that these systems be correct; however, there are few automated tools for analyzing concurrency and timing properties of these systems. The PARTS toolset uses a Petri-net-based reachability analysis to analyze program specifications written in an Ada-83 subset. Our simple time Petri nets are specifically aimed at facilitating real-time analysis. In order to control the state-explosion problem, PARTS employs several optimization techniques aimed at state-space reduction. In this paper we discuss our approach and we report on extensive experiments with several examples of real-time specifications based on Ada 83. When possible, we also compare our experimental results with results obtained by other approaches to real-time analysis.     

供应链库存博弈的均衡分析:讨价还价

通过构建供应链联合库存利润流分配的博弈模型,探讨了供应链联合库存利润流分配的机理--讨价还价.得出了企业获得的利润主要取决于企业在供应链中的相对地位的结论,指出一般企业如果想改善其在讨价还价中的处境,在讨价还价之前必须和处于关键地位的企业签定有约束力的协议,防止处于关键地位的企业利用惩罚性的策略作威胁.     

基于程序理解的编程题自动评分方法

针对传统的编程题自动评分方法没有考虑学生程序是怎样实现编程任务的,以及不能从程序文本的语法结构和语义角度衡量学生程序与正确答案的接近程度等问题,提出一种基于程序理解的自动评分方法.以程序理解的一般过程及基本策略为依据,结合人工阅卷的思维过程,建立评分模型.评分过程可划分为3个阶段:首先将程序代码转换成系统依赖图中间表示形式;然后,对系统依赖图进行标准化转换,消除程序表达方式的多样性;最后,匹配标准化后的学生程序与模板程序系统依赖图并根据匹配结果给出评分.该方法被应用于C语言编程题自动评分系统中.实验结果表明:它可以根据学生程序的语法和语义衡量学生程序实现编程任务的正确程度,具有较高的准确性.     

基于对手案例学习的多议题协商决策模型

为了解决多Agent系统(MAS)协商双方在信息对称情况下的自动协商问题,提出了一种用基于支持向量机算法的间接学习对手协商态度的协商方法,提出了不完全信息条件下基于案例和对策论的Agent多议题Pareto最优协商模型,通过支持向量机的方法来学习协商轨迹,得到协商对手在每个协商项的态度,然后利用学习得到的对手协商态度,构造了一个协商的决策模型,此模型能同时基于对手的态度和自身的偏好来做出协商决策。最后通过实验验证了该方法的先进性。     

基于手机App的自动站管理系统设计与应用

随着社会生活的信息化和互联网技术的飞速发展,智能手机的发展日新月异,手机App成为了人们获取信息的主要方式。将手机App作为载体的工作方式已成为各行业的研究方向。为了保障气象自动观测站的正常运行,必须加强及时有效的管理。以沈阳市气象局250个气象自动观测站为课题背景,对基于手机App的自动站管理系统进行了研究。手机App以Android平台为基础,系统开发服务组件使用基于Java语言的Oracle 11G EX DB和Oracle JDeveloper开发平台,通过Web Service技术实现手机与服务器组件间的数据交互。该系统提供了自动观测站实况数据查询、故障报警、建立维修任务并上传维修照片、查看维修记录等功能。这种设计既方便了管理者对自动站及维护人员的监控与管理,又提高了管理者与维护人员交互信息的效率,充分利用手机App方便快捷的功能实现全沈阳地区自动站的管理,最后将提出的设计应用于其他市区的自动站管理之中也取得了十分显著的效果。     

Revisiting the Task-Media Fit Circumflex: A further examination of negotiation tasks

McGrath and Hollingshead's Task-Media Fit Circumflex, which proposed that the negotiations tasks “best fit” highly information-rich channels, is widely accepted for more than two decades. However, this study argues that according to the task nature, different negotiation tasks shall “best fit” different media channels. A 2 × 3 laboratory experiment was conducted to test this argument. Findings suggested that higher process satisfaction, lower cognitive effort and higher negotiation efficiency would be created when text-based systems were used to execute more analyzable tasks. In contrast, less analyzable tasks best fit face-to-face or audio/video-based systems. Managerial implications are discussed accordingly.     

串联电极阵列压电传感技术自动检测病原体

以串联电极阵列压电石英晶体（SPQC）传感器为基础构建了一台8通道微生物自动检测仪。电极插入培养基检测溶液电导的变化。池常数k=0．05m,使用中性、低电导的氨基酸培养基（AaB）,电导控制灵敏度区间为550-600μs。利用拟合-微分的方法简单准确地得到频率检测时间（FDT）。对普通的金黄色葡萄球菌（S．aureus）和痢疾杆菌（S．dysenteriae）进行自动检测,结果表明：FDT和样品中细菌浓度呈线性关系（R〉0．99）,检测范围为10-10^6CFU·mL^-1。该方法准确度与国标的平板记数法相当（置信区间为95％）,但重现性更好,更稳定,灵敏度更高。     

The case of the lying postman: Decoys and deception in negotiation

Much research in negotiation assumes complete knowledge among the interacting agents and/or truthful agents. These assumptions in many domains will not be realistic, and this paper extends our previous work in dealing with the case of inter-agent negotiation with incomplete information. A discussion of our existing negotiation framework sets out the rules by which agents operate during this phase of their interaction. The concept of a solution within this framework is presented; the same solution concept serves for interactions between agents with incomplete information as it does for complete information interactions. The possibility of incomplete information among agents opens up the possibility of deception as part of the negotiation strategy of an agent. Deception during negotiation among autonomous agents is thus analyzed in the Postmen Domain, which was introduced by us in a previous paper. New results regarding the non-beneficial nature of lies is presented. It is shown that hiding letters can be beneficial when negotiation is conducted over mixed deals. When the Postmen Domain is restricted to graphs having a tree topology, then it is shown that decoy letters (manufactured by a lying agent) cannever be beneficial, and that no combination of types of lies is beneficial when negotiation is conducted over all-or-nothing deals.     

基于TestQuest的软件测试自动化方法研究

随着软件开发规模的增大以及复杂程度的增加,自动化测试工具在提高软件测试的效率及准确度上越来越重要,而现有的软件测试存在自动化程度不高、测试过程不完善等问题,针对此问题展开了软件测试自动化的研究。在分析了软件自动化测试的重要性及软件自动化测试的周期、技术的基础上,提出了基于TestQuest测试工具的一套软件测试自动化方法和测试流程,最后针对“虚拟维修训练系统”具体结合工具展开实例验证。     

Gazing: An approach to the problem of definition and lemma use

A major outstanding problem in automated theorem proving research is determining the appropriate use of definitions and previously proved theorems within a proof. Presenting the theorem prover with only the formulae that are necessary for the proof might be viewed as ‘cheating’ and requires that the user prove the theorem ahead of time. In real world applications of theorem proving, this is almost certain to be infeasible. On the other hand providing the prover with all formulae that might be relevant rapidly swamps the prover with unnecessary information. A technique for the selective retrieval of formulae based on features of those formulae and the conjecture at hand is required to solve this problem. In this paper I describe an abstraction-based technique which addresses this problem. Implicit hypotheses such as definitions, axioms and previously proved theorems are stored in a database which may be accessed by a heuristic rule of inference calledgazing. Before accessing this database the gazing rule plans the use of these formulae in a hierarchy of abstraction spaces. When the planning phase is complete, the system can use the indicated formulae with some confidence that they are relevant to the proof. Since the technique is abstraction-based, no guarantee that the plant will be eventually applicable or successful can be made. However, because the plans are built by considering increasing amounts of detail, the number of ways in which the application of a plan can fail is limited. Plan failures may be ‘patched’ in a uniform way.