Maximizing Expected Impact in an Agent Reputation Network -- Technical Report

May 14, 2018 Β· Declared Dead Β· πŸ› Deutsche Jahrestagung fΓΌr KΓΌnstliche Intelligenz

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gavin Rens, Abhaya Nayak, Thomas Meyer arXiv ID 1805.05230 Category cs.AI: Artificial Intelligence Cross-listed cs.MA Citations 3 Venue Deutsche Jahrestagung fΓΌr KΓΌnstliche Intelligenz Last Checked 4 months ago
Abstract
Many multi-agent systems (MASs) are situated in stochastic environments. Some such systems that are based on the partially observable Markov decision process (POMDP) do not take the benevolence of other agents for granted. We propose a new POMDP-based framework which is general enough for the specification of a variety of stochastic MAS domains involving the impact of agents on each other's reputations. A unique feature of this framework is that actions are specified as either undirected (regular) or directed (towards a particular agent), and a new directed transition function is provided for modeling the effects of reputation in interactions. Assuming that an agent must maintain a good enough reputation to survive in the network, a planning algorithm is developed for an agent to select optimal actions in stochastic MASs. Preliminary evaluation is provided via an example specification and by determining the algorithm's complexity.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted