dor_id: 4110151

506.#.#.a: Público

590.#.#.d: Los artículos enviados a la revista "Journal of Applied Research and Technology", se juzgan por medio de un proceso de revisión por pares

510.0.#.a: Scopus, Directory of Open Access Journals (DOAJ); Sistema Regional de Información en Línea para Revistas Científicas de América Latina, el Caribe, España y Portugal (Latindex); Indice de Revistas Latinoamericanas en Ciencias (Periódica); La Red de Revistas Científicas de América Latina y el Caribe, España y Portugal (Redalyc); Consejo Nacional de Ciencia y Tecnología (CONACyT); Google Scholar Citation

561.#.#.u: https://www.icat.unam.mx/

650.#.4.x: Ingenierías

336.#.#.b: article

336.#.#.3: Artículo de Investigación

336.#.#.a: Artículo

351.#.#.6: https://jart.icat.unam.mx/index.php/jart

351.#.#.b: Journal of Applied Research and Technology

351.#.#.a: Artículos

harvesting_group: RevistasUNAM

270.1.#.p: Revistas UNAM. Dirección General de Publicaciones y Fomento Editorial, UNAM en revistas@unam.mx

590.#.#.c: Open Journal Systems (OJS)

270.#.#.d: MX

270.1.#.d: México

590.#.#.b: Concentrador

883.#.#.u: https://revistas.unam.mx/catalogo/

883.#.#.a: Revistas UNAM

590.#.#.a: Coordinación de Difusión Cultural

883.#.#.1: https://www.publicaciones.unam.mx/

883.#.#.q: Dirección General de Publicaciones y Fomento Editorial

850.#.#.a: Universidad Nacional Autónoma de México

856.4.0.u: https://jart.icat.unam.mx/index.php/jart/article/view/699/670

100.1.#.a: Kiruthika, Usha; Somasundaram, Thamarai Selvi

524.#.#.a: Kiruthika, Usha, et al. (2018). Efficient agent-based negotiation by predicting opponent preferences using AHP. Journal of Applied Research and Technology; Vol. 16 Núm. 1. Recuperado de https://repositorio.unam.mx/contenidos/4110151

245.1.0.a: Efficient agent-based negotiation by predicting opponent preferences using AHP

502.#.#.c: Universidad Nacional Autónoma de México

561.1.#.a: Instituto de Ciencias Aplicadas y Tecnología, UNAM

264.#.0.c: 2018

264.#.1.c: 2019-06-20

653.#.#.a: Automated Negotiation; Opponent Modeling; Analytic Hierarchy Process; Trade-off; SLA

506.1.#.a: La titularidad de los derechos patrimoniales de esta obra pertenece a las instituciones editoras. Su uso se rige por una licencia Creative Commons BY-NC-SA 4.0 Internacional, https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es, para un uso diferente consultar al responsable jurídico del repositorio por medio del correo electrónico gabriel.ascanio@icat.unam.mx

884.#.#.k: https://jart.icat.unam.mx/index.php/jart/article/view/699

001.#.#.#: 074.oai:ojs2.localhost:article/699

041.#.7.h: eng

520.3.#.a: Negotiation is a process essential for a wide range of applications. The complex decision making involved in negotiation makes its automation difficult. The complexity is further increased as negotiators hide their individual preferences from each other to avoid exploitation by the opponent. Even though sharing of private preference information leads to better agreement for both sides, it is never done in the absence of trust. In this work, we learn opponent’s preference information from the offers given by the opponent using Analytic Hierarchy Process (AHP). We apply our approach to the negotiation of Quality-of-Service (QoS) parameters for the establishment of Service Level Agreements (SLA) between a provider and a consumer. Experiments show that using AHP, the negotiations are faster and the agreements are on or nearer to the pareto-optimal line.

773.1.#.t: Journal of Applied Research and Technology; Vol. 16 Núm. 1

773.1.#.o: https://jart.icat.unam.mx/index.php/jart

022.#.#.a: ISSN electrónico: 2448-6736; ISSN: 1665-6423

310.#.#.a: Bimestral

264.#.1.b: Instituto de Ciencias Aplicadas y Tecnología, UNAM

doi: https://doi.org/10.22201/icat.16656423.2018.16.1.699

harvesting_date: 2023-11-08 13:10:00.0

856.#.0.q: application/pdf

file_creation_date: 2019-11-04 17:36:23.0

file_modification_date: 2019-11-04 17:36:23.0

file_creator: MAE

file_name: 37eff900068b3e62f28031c00d6ac635201328e4fb4cdd11663000f201b9db8a.pdf

file_pages_number: 13

file_format_version: application/pdf; version=1.5

file_size: 5259859

last_modified: 2024-03-19 14:00:00

license_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es

license_type: by-nc-sa

No entro en nada

No entro en nada 2

Artículo

Efficient agent-based negotiation by predicting opponent preferences using AHP

Kiruthika, Usha; Somasundaram, Thamarai Selvi

Instituto de Ciencias Aplicadas y Tecnología, UNAM, publicado en Journal of Applied Research and Technology, y cosechado de Revistas UNAM

Licencia de uso

Procedencia del contenido

Cita

Kiruthika, Usha, et al. (2018). Efficient agent-based negotiation by predicting opponent preferences using AHP. Journal of Applied Research and Technology; Vol. 16 Núm. 1. Recuperado de https://repositorio.unam.mx/contenidos/4110151

Descripción del recurso

Autor(es)
Kiruthika, Usha; Somasundaram, Thamarai Selvi
Tipo
Artículo de Investigación
Área del conocimiento
Ingenierías
Título
Efficient agent-based negotiation by predicting opponent preferences using AHP
Fecha
2019-06-20
Resumen
Negotiation is a process essential for a wide range of applications. The complex decision making involved in negotiation makes its automation difficult. The complexity is further increased as negotiators hide their individual preferences from each other to avoid exploitation by the opponent. Even though sharing of private preference information leads to better agreement for both sides, it is never done in the absence of trust. In this work, we learn opponent’s preference information from the offers given by the opponent using Analytic Hierarchy Process (AHP). We apply our approach to the negotiation of Quality-of-Service (QoS) parameters for the establishment of Service Level Agreements (SLA) between a provider and a consumer. Experiments show that using AHP, the negotiations are faster and the agreements are on or nearer to the pareto-optimal line.
Tema
Automated Negotiation; Opponent Modeling; Analytic Hierarchy Process; Trade-off; SLA
Idioma
eng
ISSN
ISSN electrónico: 2448-6736; ISSN: 1665-6423

Enlaces