| Form of presentation | Articles in international journals and collections |
| Year of publication | 2023 |
| Язык | английский |
|
Pinyagina Olga Vladislavovna, author
|
| Bibliographic description in the original language |
Pinyagina O., An Algorithm for Decentralized Multi-agent Feasibility Problems//Communications in Computer and Information Science. - 2023. - Vol.1881 CCIS, Is.. - P.19-28. |
| Annotation |
We consider the feasibility problem in a multi-agent decentralized form, where each agent has the personal information of the feasible subset, which is unknown to other agents. The common feasible set is composed of the agents' feasible subsets. For solving this problem, we reformulate it in the form of a variational inequality and propose an algorithm based on the projection method. Preliminary test calculations confirm the efficiency of the proposed approach. |
| Keywords |
Feasibility problem,
Decentralized system,
Projection method,
Variational inequality |
| The name of the journal |
Communications in Computer and Information Science
|
| URL |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85174624553&doi=10.1007%2f978-3-031-43257-6_2&partnerID=40&md5=cff0d523c62cfe8e70c61d891d76a731 |
| Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=290811&p_lang=2 |
Full metadata record  |
| Field DC |
Value |
Language |
| dc.contributor.author |
Pinyagina Olga Vladislavovna |
ru_RU |
| dc.date.accessioned |
2023-01-01T00:00:00Z |
ru_RU |
| dc.date.available |
2023-01-01T00:00:00Z |
ru_RU |
| dc.date.issued |
2023 |
ru_RU |
| dc.identifier.citation |
Pinyagina O., An Algorithm for Decentralized Multi-agent Feasibility Problems//Communications in Computer and Information Science. - 2023. - Vol.1881 CCIS, Is.. - P.19-28. |
ru_RU |
| dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=290811&p_lang=2 |
ru_RU |
| dc.description.abstract |
Communications in Computer and Information Science |
ru_RU |
| dc.description.abstract |
We consider the feasibility problem in a multi-agent decentralized form, where each agent has the personal information of the feasible subset, which is unknown to other agents. The common feasible set is composed of the agents' feasible subsets. For solving this problem, we reformulate it in the form of a variational inequality and propose an algorithm based on the projection method. Preliminary test calculations confirm the efficiency of the proposed approach. |
ru_RU |
| dc.language.iso |
ru |
ru_RU |
| dc.subject |
Feasibility problem |
ru_RU |
| dc.subject |
Decentralized system |
ru_RU |
| dc.subject |
Projection method |
ru_RU |
| dc.subject |
Variational inequality |
ru_RU |
| dc.title |
An Algorithm for Decentralized Multi-agent Feasibility Problems |
ru_RU |
| dc.type |
Articles in international journals and collections |
ru_RU |
|
RUS 
中文 
ES 
Sitemap
