Generating Pareto-optimal offers in bilateral automated negotiation with one-side uncertain importance weights

zbMATH Open1413.68154MaRDI QIDQ4610065FDOQ4610065

Authors: Hamid Jazayeriy, Masrah Azmi-Murad, Nasir Sulaiman, Nur Izura Udzir 

Publication date: 5 April 2018

Recommendations

• Efficient methods for automated multi-issue negotiation: Negotiating over a two-part tariff
• Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
• Bargaining with incomplete information
• A decentralized model for automated multi-attribute negotiations with incomplete information and general utility functions
• Bargaining over multiple issues in finite horizon alternating-offers protocol

zbMATH Keywords

algorithmuncertain informationbilateral negotiationPareto-optimal offer

Mathematics Subject Classification ID

Noncooperative games (91A10) Agent technology and artificial intelligence (68T42)

Cited In (1)

• Weight-based negotiation mechanisms: balancing personal utilities

This page was built for publication: Generating Pareto-optimal offers in bilateral automated negotiation with one-side uncertain importance weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610065)