Using Iterative Narrowing to Enable Multi-Party Negotiations with Multiple Interdependent Issues

European Journal of Operational Research

Brandt

2016

Section: Related Workmentioning

confidence: 99%

Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling

European Journal of Operational Research

Brandt

2016

“…Fujita et al [47] propose mediated protocols for complex contracts, which maintain the agents' privacy; that is, they do not reveal private information. Marsa-Maestre [48], Copyright Fujita et al [49,50], and Hattori et al [6] propose bidding-based protocols as a solution approach for complex contract spaces. Based on the work of Klein et al [22], Fink [21] proposes a quotas-based negotiation protocol with acceptance quotas over time and applies it to supply chain coordination.…”

Section: Related Workmentioning

confidence: 99%

“…At this, information fulfills a central role: Agents may have an incentive to lie about their preferences; that is, revealed information might be unreliable and, hence, not usable [5]. Furthermore, in case of agents as representatives of different 2870 F. LANG AND A. FINK enterprises, the participating negotiators might dislike the revelation of information, for example, when the negotiating enterprises are competitors [6,7]. Especially in an inter-company scenario, the agents are supposed to work collaboratively but not cooperatively.…”

Section: Introductionmentioning

confidence: 99%

Collaborative machine scheduling: Challenges of individually optimizing behavior

Concurrency and Computation

2014

SUMMARYCollaborative interorganizational systems is a relevant and promising research domain. When autonomous agents associated with different enterprises negotiate about rival resources, coordination is a major challenge. As agents are driven by self-interest and try to maximize their very own objectives, collaborative planning has to account for some challenges. Collaboration, that is, the participation in a common, shared system, may be profitable for an agent, but cooperation, that is, the pursuing of a common goal, may not be. Additionally, information provided by the agents is a fruit of a poisonous tree because the selfish agents have an incentive to lie strategically, which makes the revealed information unreliable and misleading for a central authority. Moreover, the agents might not be willing to reveal information because of privacy concerns. Consequently, there is a need for sophisticated mechanism design in collaborative systems that facilitate the coordination of non-cooperative agents. This paper deals with rival machine scheduling of one or more homogeneous machines by autonomous agents. Overall objectives are the minimization of the collective total weighted tardiness and Pareto efficient outcomes. We have developed a mediated negotiation protocol drawing on quotas for the acceptance of contract proposals. The protocol ensures that the agents accept sufficient proposals such that they can overcome individual local optima and achieve Pareto superior outcomes. For evaluation purposes, we have conducted several computational experiments. The experiments show that the proposed protocol achieves beneficial outcomes.

show abstract

“…Fujita et al [19] propose mediated protocols for complex contracts which maintain the agents' privacy, i.e., they do not reveal private information. Marsa-Maestre [20], Fujita et al [21] and Hattori et al [7] propose bidding-based protocols as solution approach. Based on the cooperative agent type from Klein et al [13], Fink [22] proposes a quotas-based negotiation protocol with acceptance quotas over time and applies it to supply chain coordination.…”

Section: Related Workmentioning

confidence: 99%

“…At this, information fulfills a central role: Agents may have an incentive to lie about their preferences, i.e., revealed information might be unreliable and, hence, not usable [5]. Furthermore, in case of agents as representatives of different enterprises, the participating negotiators might dislike the revelation of information, e.g., when the negotiating enterprises are competitors [6] [7].…”

Section: Introductionmentioning

confidence: 99%

Collaborative single and parallel machine scheduling by autonomous agents

2012 International Conference on Collaboration Technologies and Systems (CTS)

2012