Distributed consensus in noncooperative inventory games
AbstractThis paper deals with repeated nonsymmetric congestion games in which the players cannot observe their payoffs at each stage. Examples of applications come from sharing facilities by multiple users. We show that these games present a unique Pareto optimal Nash equilibrium that dominates all other Nash equilibria and consequently it is also the social optimum among all equilibria, as it minimizes the sum of all the players' costs. We assume that the players adopt a best response strategy. At each stage, they construct their belief concerning others probable behavior, and then, simultaneously make a decision by optimizing their payoff based on their beliefs. Within this context, we provide a consensus protocol that allows the convergence of the players' strategies to the Pareto optimal Nash equilibrium. The protocol allows each player to construct its belief by exchanging only some aggregate but sufficient information with a restricted number of neighbor players. Such a networked information structure has the advantages of being scalable to systems with a large number of players and of reducing each player's data exposure to the competitors.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 192 (2009)
Issue (Month): 3 (February)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Game theory Multi-agent systems Inventory Consensus protocols;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Meca, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 2004.
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-129329, Tilburg University.
- Sila Çetinkaya & Chung-Yee Lee, 2000. "Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems," Management Science, INFORMS, vol. 46(2), pages 217-232, February.
- Milchtaich, Igal, 1996. "Congestion Games with Player-Specific Payoff Functions," Games and Economic Behavior, Elsevier, vol. 13(1), pages 111-124, March.
- Martin J. Osborne & Ariel Rubinstein, 1994.
"A Course in Game Theory,"
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262650401, January.
- Frank Chen & Zvi Drezner & Jennifer K. Ryan & David Simchi-Levi, 2000. "Quantifying the Bullwhip Effect in a Simple Supply Chain: The Impact of Forecasting, Lead Times, and Information," Management Science, INFORMS, vol. 46(3), pages 436-443, March.
- Friedman, Eric J., 1996. "Dynamics and Rationality in Ordered Externality Games," Games and Economic Behavior, Elsevier, vol. 16(1), pages 65-76, September.
- Qinan Wang, 2001. "Coordinating Independent Buyers in a Distribution System to Increase a Vendor's Profits," Manufacturing & Service Operations Management, INFORMS, vol. 3(4), pages 337-348, May.
- Hartman, Bruce C. & Dror, Moshe & Shaked, Moshe, 2000. "Cores of Inventory Centralization Games," Games and Economic Behavior, Elsevier, vol. 31(1), pages 26-49, April.
- Hau Lee & Seungjin Whang, 1999. "Decentralized Multi-Echelon Supply Chains: Incentives and Information," Management Science, INFORMS, vol. 45(5), pages 633-640, May.
- Watts, Alison, 2002. "Uniqueness of equilibrium in cost sharing games," Journal of Mathematical Economics, Elsevier, vol. 37(1), pages 47-70, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.