Working paper
Achieving pareto optimality through distributed learning
- Abstract:
-
We propose a simple payoff-based learning rule that is completely decentralized, and that leads to an efficient configuaration of actions in any n-person finite strategic-form game with generic payoffs. The algorithm follows the theme of exploration versus exploitation and is hence stochastic in nature. We prove that if all agents adhere to this algorithm, then the agents will select the action profile that maximizes the sum of the agents' payoffs a high percentage of time. The algorithm r...
Expand abstract
- Publication status:
- Published
Actions
Authors
Bibliographic Details
- Publisher:
- University of Oxford Publisher's website
- Series:
- Department of Economics Discussion Paper Series
- Publication date:
- 2011-07-01
- Paper number:
- 557
Item Description
- Keywords:
- Pubs id:
-
1143879
- Local pid:
- pubs:1143879
- Deposit date:
- 2020-12-15
Terms of use
- Copyright date:
- 2011
- Rights statement:
- Copyright 2011 The Author(s)
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record