Distributed Constrained Search by Selfish Agents for Efficient Equilibria
link.springer.com › chapter
Aug 23, 2018 · The present paper proposes a distributed search algorithm that uses transfer of funds among selfish agents. The final outcome of the algorithm ...
To find stable solutions (e.g., pure Nash equilibria - PNEs) of high efficiency, the multiple agents of the game perform a distributed search on an asymmetric ...
Dive into the research topics of 'Distributed constrained search by selfish agents for efficient equilibria'. Together they form a unique fingerprint. Sort by ...
Distributed Constrained Search by Selfish Agents for Efficient Equilibria · Computer Science, Economics. International Conference on Principles and… · 2018.
Aug 2, 2024 · Distributed Constrained Search by Selfish Agents for Efficient Equilibria. Chapter © 2018. Distributed Optimization Algorithm for Multi-agent ...
Incentive-based search for efficient equilibria of the public goods game ... Distributed Constrained Search by Selfish Agents for Efficient Equilibria · V ...
In a simultaneous game, the agents are selfish - each of them wants to maximize his/her own utility (or minimize his/her own cost). · In an ADCOP, the agents are ...
Distributed Constrained Search by Selfish Agents for Efficient Equilibria ... search algorithm that uses transfer of funds among selfish agents. The final ...
Apr 13, 2022 · 2018. Distributed Constrained Search by Selfish Agents for Efficient Equilibria. In Proc. 24th Intern. Conf. Princ. Pract. Const. Prog. (CP-18).
Finally, for general games, a distributed local search algorithm that uses transfer of funds among selfish agents will be presented. The final outcome of ...