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 …

This paper presents an in-depth analysis and the key insights gained from the Second
International Automated Negotiating Agents Competition (ANAC 2011). ANAC is an …

Abstract The third Automated Negotiating Agents Competition (ANAC 2012) was held at the
11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS …

The weighted bipartite-matching problem (WBM) plays a significant role in many real-world
applications, including resource allocation, scheduling, Internet advertising, and E …

The manufacturing field is an area where the application of simulation is an essential tool for
validating methods and architectures before applying them on the factory floor. Despite the …

Existing work on automated negotiations has mainly focused on bilateral negotiations with
linear utility functions. It is often assumed that all possible agreements and their utility values …

Abstract Existing work on Automated Negotiations commonly assumes the negotiators' utility
functions have explicit closed-form expressions, and can be calculated quickly. In many real …

Negotiation is an important activity in human society, and is studied by various disciplines,
ranging from economics and game theory, to electronic commerce, social psychology, and …

[EN] In this paper we present a new algorithm for negotiations in non-zero-sum games.
Although games have been studied extensively, most game playing algorithms have been …

Optimizing resource use in complex networks with self-interested participants (eg
transportation networks, electric grids, Internet systems) is a challenging and increasingly …