A baseline for non-linear bilateral negotiations: the full results of the agents competing in ANAC 2014

In the past few years, there is a growing interest in automated negotiation in which software agents facilitate negotiation on behalf of their users and try to reach joint agreements. The potential value of developing such mechanisms becomes enormous when negotiation domain is too complex for humans to find agreements (e.g. e-commerce) and when software components need to reach agreements to work together (e.g. web-service composition). Here, one of the major challenges is to design agents that are able to deal with incomplete information about their opponents in negotiation as well as to effectively negotiate on their users’ behalves. To facilitate the research in this field, an automated negotiating agent competition has been organized yearly. This paper introduces the research challenges in Automated Negotiating Agent Competition (ANAC) 2014 and explains the competition set up and results. Furthermore, a detailed analysis of the best performing five agents has been examined

An agent-based approach to intelligent manufacturing network configuration

The participation of small and medium enterprises in inter-firm collaboration can enhance their market reach while maintaining production lean. The conventional centralised collaboration approach is believed to be unsustainable, in today’s complex environment. The research aimed to investigate manufacturing network collaborations, where manufacturers maintain control over their scheduling activities and participate in a market-based event, to decide which collaborations are retained. The work investigated two pairing mechanisms where the intention was to capture and optimise collaboration at the granular level and then build up a network from those intermediate forms of organisation. The research also looked at two bidding protocols. The first protocol involves manufacturers that bid for operations from the process plan of a job. The second protocol is concerned with networks that bid for a job in its entirety. The problem, defined by an industrial use case and operation research data sets, was modelled as decentralised flow shop scheduling. The holonic paradigm identified the problem solving agents that participated in agent-based modelling and simulation of the pairing and the bidding protocols. The protocols are strongly believed to achieve true decentralisation of scheduling, with good performance on scalability, conflict resolution and schedule optimisation, for the purpose of inter-firm collaboration

Efficient Issue-Grouping Approach for Multi-Issues Negotiation between Exaggerator Agents

Most real-world negotiation involves multiple interdependent issues, which makes an agent's utility functions complex. Traditional negotiation mechanisms, which were designed for linear utilities, do not fare well in nonlinear contexts. One of the main challenges in developing effective nonlinear negotiation protocols is scalability; it can be extremely difficult to find high-quality solutions when there are many issues, due to computational intractability. One reasonable approach to reducing computational cost, while maintaining good quality outcomes, is to decompose the contract space into several largely independent sub-spaces. In this paper, we propose a method for decomposing a contract space into sub-spaces based on the agent's utility functions. A mediator finds sub-contracts in each sub-space based on votes from the agents, and combines the sub-contracts to produce the final agreement. We demonstrate, experimentally, that our protocol allows high-optimality outcomes with greater scalability than previous efforts. We also address incentive compatibility issues. Any voting scheme introduces the potential for strategic non-truthful voting by the agents, and our method is no exception. For example, one of the agents may always vote truthfully, while the other exaggerates so that its votes are always "strong." It has been shown that this biases the negotiation outcomes to favor the exaggerator, at the cost of reduced social welfare. We employ the limitation of strong votes to the method of decomposing the contract space into several largely independent sub-spaces. We investigate whether and how this approach can be applied to the method of decomposing a contract space

Interactions, improvisations and arrangements in the process of informing.

SIGLEAvailable from British Library Document Supply Centre- DSC:D42580/82 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

The Bakhtinian chronotope : origins, modifications and additions

The purposes of this thesis are as follows: To examine the nature of Bakhtin's concept of the Chronotpe, particularly in the novel, and to trace its conceptual origins in literature, in other branches of the Humanities, and in the Exact Sciences. To modify Bakhtin's application of Chronotype theory to certain classes of literature, and certain specific examples of the novel and epic genres, where, in my opinion, these methods have been wrongly or insufficently applied. To trace the History of the Chronotope in literature from the time of Homer to that of Balzac, using information drawn from Bakhtin's essays, and additionally supplemented by material of my own inclusion. These inclusions are sometimes necessary either to bridge the hiatus in Bakhtin's textual sequentiality, or to supplement the range of illustrative material to which he was confied by the dictates of Russian communist bureaucracy