Skip to main content
Log in

An Incentive-Compatible and Computationally Efficient Fog Bargaining Mechanism

  • Published:
Computational Economics Aims and scope Submit manuscript

Abstract

This work contributes an (approximately) incentive-compatible and computationally efficient bargaining mechanism for pricing fog computing resources. In network settings (e.g., fog computing), it is plausible to think that self-interested and incompletely informed players (represented by software agents) will attempt to maximize their own benefits at the expense of others. Hence, it is crucial that fog bargaining mechanisms give incentives to agents for behaving in a manner consistent with the desired outcome where every agent’s benefit is maximized. Equilibrium analyses validate that the fog bargaining mechanism in this work is approximately Bayesian incentive compatible because every agent can approximately maximize its expected utility by adhering to the strategy recommended by the bargaining mechanism given that all other agents also adhere to their equilibrium strategies. That is, if every agent in the market adheres to the strategy recommended by the bargaining mechanism, then the strategy profile of the agents forms an approximate Bayesian Nash equilibrium. Given that a fog resource market has a large number of buyers and a large number of sellers, computational efficiency is also imperative since every agent needs to process a huge number of trading alternatives. Computational complexity analyses validate that 1) the procedure for carrying out the bargaining strategy has a linear time complexity, and with every passing round, the search space dwindles but the solutions become progressively better, 2) the number of rounds for each agent to complete bargaining is logarithmic in the number of its opponents, and 3) each agent has a linear message complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Data Availability

Not applicable.

Code Availability

Not applicable.

Notes

  1. Muthoo (1999, p. 73) noted that bargaining may break down randomly because human players may get fed up and walk away from the negotiating table as negotiations become protracted. Since “walking away” is a random human behavior, the risk of breakdown due to impatience does not apply to software agents.

  2. Since the fog bargaining mechanism is designed to bolster bargaining among software agents, in the context of this paper, the possessive determiner (respectively, pronoun) “its” (respectively, “it”) instead of “his/her” (respectively, “he/she”) will be used to refer to “agent’s” (respectively, “agent”).

  3. In the STDMC protocol, the time interval between two consecutive bargaining rounds \(t-1\) and \(t\) is extremely short since software agents, which carry out bargaining activities on behalf of human buyers and sellers, operate at machine speed. Contemporary computers have clock speed of several gigahertz or several billion clock cycles per second with each cycle lasting only one-billionth of a second. Muthoo (1999, p. 75) noted that as the time interval \(\Delta \) between two consecutive offers decreases, the probability of breakdown \({{P}_{BD}}\) between two consecutive offers owing to exogenous intervention by a third party (Osborne and Rubinstein 1990, pp. 71–72; Muthoo 1999, p. 73) also decreases. That is, \({P}_{{\textit{B}}{\textit{D}}}\to 0\) as \(\Delta \to 0\). Hence, in the STDMC protocol, \({P}_{{\textit{B}}{\textit{D}}}\) between \(t-1\) and \(t\) is negligible.

  4. Unlike a bargaining game of alternating offers, the issue of a “first-mover advantage” (Osborne and Rubinstein 1990, p. 52; Muthoo 1999, p. 46) does not apply to the STDMC protocol because all agents (both buyers and sellers) simultaneously exchange price proposals at every round.

  5. Incentive compatibility is a stringent requirement that is difficult to realize because it requires that every strategy that deviates from the equilibrium strategy be dominated by the equilibrium strategy (Roberts and Postlewaite 1976, p. 118).

References

  • Alkemade, F., La Poutré, H., & Amman, H. M. (2007). On social learning and robust evolutionary algorithm design in the Cournot oligopoly game. Computational Intelligence, 23(2), 162–175.

    Article  Google Scholar 

  • Amman, H. M., & Kendrick, D. A. (2000). Stochastic policy design in a learning environment with rational expectations. Journal of Optimization Theory and Applications, 105(3), 509–520.

    Article  Google Scholar 

  • Azevedo, E. M., & Budish, E. (2019). Strategy-proofness in the large. Review of Economic Studies, 86(1), 81–116.

    Google Scholar 

  • Bittencourt, L.F., Lopes, M.M., Petri, I., Rana, O.F. (2015). Towards virtual machine migration in fog computing. In Proceedings of 2015 10th international conference on P2P, Parallel, Grid, Cloud and Internet Computing, 4–6 Nov., Krakow, Poland, 1–8.

  • Bulow, J., & Klemperer, P. (1996). Auctions versus negotiation. American Economic Review, 86(1), 180–194.

    Google Scholar 

  • Carpenter, J. P. (2002). Evolutionary models of bargaining: comparing agent-based computational and analytical approaches to understanding convention evolution. Computational Economics, 19(1), 25–49.

    Article  Google Scholar 

  • Chatterjee, K., & Samuelson, W. (1983). Bargaining under incomplete information. Operations Research, 31(5), 835–851.

    Article  Google Scholar 

  • CISCO (2015). Fog Computing and the internet of things: extend the cloud to where the things are. CISCO Whitepaper (2015). https://www.cisco.com/c/dam/en_us/solutions/trends/iot/docs/computing-overview.pdf.

  • Clempner, J. B., & Poznyak, A. S. (2017). Negotiating transfer pricing using the Nash bargaining solution. International Journal of Applied Mathematics and Computer Science, 27(4), 853–864.

    Article  Google Scholar 

  • Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms 3rd edn. MIT Press.

    Google Scholar 

  • Dupuis, P., & Nagurney, A. (1993). Dynamical systems and variational inequalities. Annals of Operations Research, 44(1), 7–42.

    Article  Google Scholar 

  • Fang, X., Guo, H., Zhang, X., Wang, X., & Chen, Q. (2022). An efficient and incentive-compatible market design for energy storage participation. Applied Energy, 311, 118731.

    Article  Google Scholar 

  • Floudas, C. A., & Pardalos, P. M. (1990). A Collection of test problems for constrained global optimization algorithms. Lecture Notes in Computer Science 455, Springer-Verlag.

    Book  Google Scholar 

  • Friedman, D. (1993). The double auction institution: A survey. In Friedman D, Rust J (eds.), The Double Auction Market: Institutions, Theories and Evidence. Perseus Publishing, Cambridge, MA, Chapter 1, 3–25.

  • Haake, C.-J., & Recker, S. (2018). The generalized Nash bargaining solution for transfer price negotiations under incomplete information. Group Decision and Negotiation, 27(6), 905–932.

    Article  Google Scholar 

  • Hurwicz, L. (1972). On informationally decentralized systems. In C. B. McGuire and R. Radner (eds.), Decision and Organization: A Volume in Honor of Jacob Marshak. North-Holland, 297–336.

  • Iorga, M., Feldman, L., Barton, R., Martin, MJ., Goren, N., & Mahmoudi, C. (2018). Fog Computing Conceptual Model—Recommendations of the National Institute of Standards and Technology. NIST Special Publication 500–325.

  • Ledyard, J. O. (1989). Incentive Compatibility. In J. Eatwell, M. Milgate, & P. Newman (Eds.), Allocation, Information and Markets (pp. 141–151). Palgrave Macmillan.

    Chapter  Google Scholar 

  • Muthoo, A. (1999). Bargaining Theory with Applications. Cambridge University Press.

    Book  Google Scholar 

  • Myerson, R. B., & Satterthwaite, M. A. (1983). Efficient mechanisms for bilateral trading. Journal of Economic Theory, 29(2), 265–281.

    Article  Google Scholar 

  • Nisan, N., & Ronen, A. (2001). Algorithmic mechanism design. Games and Economic Behavior, 35(1–2), 166–196.

    Article  Google Scholar 

  • Nisan, N., Roughgarden, T., Tardos, E., & Vazirani, V. (eds.) (2007). Algorithmic Game Theory, Cambridge University Press.

  • O’Halloran, J. (2020). Industrial IoT connections to reach 37 billion by 2025. Computer Weekly Nov. 2020. URL: https://www.computerweekly.com/news/252491495/Industrial-IoT-connections-to-reach-37-billion-by-2025.

  • Osborne, M. J., & Rubinstein, A. (1990). Bargaining and markets. Academic Press.

    Google Scholar 

  • Perloff, J. (2017). Microeconomics Theory and Applications with Calculus (4th ed.), Pearson.

  • Roberts, D. J., & Postlewaite, A. (1976). The incentives for price-taking behavior in large exchange economies. Econometrica, 44(1), 115–127.

    Article  Google Scholar 

  • Rosenschein, J. S., & Zlotkin, G. (1994). Rules of encounter: designing conventions for automated negotiation among computers. MIT Press.

  • Shoham, Y., & Leyton-Brown, K. (2009). Multiagent Systems: Algorithmic, Game-theoretic and Logical Foundation. Cambridge University Press.

    Google Scholar 

  • Sim, K. M. (2012). Agent-based cloud computing. IEEE Transactions on Services Computing, 5(4), 564–577.

    Article  Google Scholar 

  • Sim, K. M. (2013). Complex and concurrent negotiations for multiple interrelated e-markets. IEEE Transactions on Cybernetics, 43(1), 230–245.

    Article  Google Scholar 

  • Sim, K. M. (2015). Agent-based interactions and economic encounters in an intelligent intercloud. IEEE Transactions on Cloud Computing, 3(3), 358–371.

    Article  Google Scholar 

  • Sim, K. M. (2018). Agent-based fog computing: gossiping, reasoning, and bargaining. IEEE Letters of the Computer Society, 1(2), 21–24.

    Article  Google Scholar 

  • Sim, K. M. (2019a). A computationally efficient bargaining mechanism for fog commerce. IEEE Letters of the Computer Society, 2(1), 5–8.

    Article  Google Scholar 

  • Sim, K. M. (2019b). Agent-based approaches for intelligent intercloud resource allocation. IEEE Transactions on Cloud Computing, 7(2), 442–455.

    Article  Google Scholar 

  • Sim, K. M. (2022a). Intelligent resource management in intercloud, fog, and edge: tutorial and new directions. IEEE Transactions on Services Computing, 15(2), 1157–1174.

    Article  Google Scholar 

  • Sim, K. M. (2022b). Cooperative and parallel fog discovery and pareto optimal fog commerce bargaining. IEEE Transactions on Computational Social Systems, 9(4), 1112–1121.

    Article  Google Scholar 

  • Swinkels, J. M. (2001). Efficiency of large private value auctions. Econometrica, 69(1), 37–68.

    Article  Google Scholar 

  • Tao, Z., Xia, Q., Hao, Z., Li, C., Ma, L., Yi, S., & Li, Q. (2019). A Survey of virtual machine management in edge computing. Proceedings of the IEEE, 107(8), 1482–1499.

    Article  Google Scholar 

  • Trejo, K. K., Juarez, R., Clempner, J. B., & Poznyak, A. S. (2020). Non-cooperative bargaining with unsophisticated agents. Computational Economics. https://doi.org/10.1007/s10614-020-10003-7.

    Article  Google Scholar 

  • Tucci, M. P., Kendrick, D. A., & Amman, H. M. (2010). The parameter set in an adaptive control monte carlo experiment: some considerations. Journal of Economic Dynamics and Control, 34(9), 1531–1549.

    Article  Google Scholar 

  • Williams, S. R. (1999). A characterization of efficient, Bayesian incentive compatible mechanisms. Economic Theory, 14(1), 155–180.

    Article  Google Scholar 

  • Wooldridge, M. (2009). An introduction to multiagent systems (2nd ed.). New York: Wiley.

    Google Scholar 

Download references

Acknowledgements

The author thanks two anonymous reviewers for their comments and suggestions.

Funding

No funds, grants, or other support was received.

Author information

Authors and Affiliations

Authors

Contributions

Kwang Mong Sim is the sole author of this article.

Corresponding author

Correspondence to Kwang Mong Sim.

Ethics declarations

Conflict of interest

The author declares that he has no conflict of interest/competing interest.

Consent to Participate

Not applicable.

Ethical Approval

Not applicable.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Kwang Mong Sim, IET Fellow.

Appendix: Numerical Examples

Mathematical proofs in Sects. 3 and 4 have already fulfilled the objectives of this paper, which are validating both the properties of (approximate) Bayesian incentive compatibility and computational efficiency of the AFB mechanism. This appendix is added at the request of an anonymous reviewer to aid non-specialist readers in understanding the AFB mechanism. Readers with knowledge in (algorithmic) mechanism design who are only interested in the formal proofs can skip the Appendix entirely.

Appendix: Numerical Examples

Since the AFB mechanism is designed for bargaining between many buyers and many sellers, bargaining situations where 1) there are more sellers than buyers, 2) there is an equal number of buyers and sellers, and 3) there are more buyers than sellers were studied with the following parameters.

Agent type: Each agent-based fog resource market is comprised of a large number of buyer agents (BAs) representing owners of IoTs and a large number of seller agents (SAs) representing owners of fog nodes.

Market type: Buyer-to-seller ratios of {2:3, 3:4, 4:5}, {1:1}, and {5:4, 4:3, 3:2} were used to model “buyer-favorable”, “balanced”, and “seller-favorable” fog resource markets, respectively. For example, a seller-favorable fog resource market with a buyer-to-seller ratio of 4:3 can be modeled by having \({10}^{6}\) BAs and \(7.5\times {10}^{5}\) SAs.

Market closing time: The market closing time \(\tau \) is determined based on Theorem 6. For example, in a fog resource market with \({10}^{6}\) BAs and \(7.5\times {10}^{5}\) SAs, i.e., \(\left|{\mathbb{B}}\right|={10}^{6}\) and \(\left|{\mathbb{S}}\right|=7.5\times {10}^{5}\), it follows from Theorem 6 that \(\tau =\frac{1}{2}\lceil{\mathrm{log}}_{2}\mathit{max}(\left|{\mathbb{B}}\right|,\left|{\mathbb{S}}\right|)\rceil=10\).

Price range: To study bargaining situations where there is a feasible chance for BAs and SAs to reach agreements on the subscription price for a fog computing service, it is assumed without loss of generality that there exists an intersection between the range of agreeable prices of BAs and the range of agreeable prices of SAs. Whereas the IP and RP of BAs were uniformly generated from the closed intervals \([\mathrm{10,60}]\) and \([\mathrm{70,120}]\), respectively, the IP and RP of SAs were also uniformly generated from \([\mathrm{90,140}]\) and \([\mathrm{30,80}]\), respectively.

Protocol: All BAs and SAs followed the STDMC protocol (Sect. 2.1). Hence, all agents made their price proposals simultaneously at every round.

Strategy: All BAs and SAs adopted the VO strategy (Sect. 2.2). The proofs of Theorems 1, 2, and 3 validate that there is generally no incentive for agents to diverge from the equilibrium strategy, i.e., the VO strategy. For ease of exposition on how agents execute the VO strategy, consider the bargaining between \({\textit{BA}}_{539611}\) with \(\left[\textit{IP}_{B539611},{\textit{RP}}_{B539611}\right]=[\mathrm{59.520,9}0.011]\) and \({\textit{SA}}_{1682}\) with \(\left[{\textit{RP}}_{S1682},\textit{IP}_{S1682}\right]=[\mathrm{47.112,93.870}]\), which was only one example among many concurrent bargaining of a large number of BA-SA pairs in the seller-favorable fog resource market described above. At \(t=0\), while \({\textit{BA}}_{539611}\) proposed \(59.520\), \({\textit{SA}}_{1682}\) simultaneously proposed \(93.870\). However, it is reminded that the bargaining between \({\textit{BA}}_{539611}\) and \({\textit{SA}}_{1682}\) is NOT a bilateral bargaining, e.g., at \(t=0\), \({\textit{BA}}_{539611}\) also received proposals from many other SAs with the highest price proposal of \(132.430\) from \({\textit{SA}}_{67845}\) such that the maximum price difference between \({\textit{BA}}_{539611}\) and its opponent was \({\pi }_{t=0}^{B539611\leftrightarrow max}=132.430-59.520=72.910\) while \({\textit{SA}}_{1682}\) also received proposals from many other BAs with the lowest price proposal of \(10.110\) from \({\textit{BA}}_{791336}\) such that \({\pi }_{t=0}^{S1682\leftrightarrow max}=93.870-10.110=83.760\). While the price difference between \({\textit{BA}}_{539611}\) and \({\textit{SA}}_{1682}\) was \(93.870-59.520=34.350\), from (4) (Sect. 2.2), the normalized price difference between \({\textit{BA}}_{539611}\) and \({\textit{SA}}_{1682}\) from the perspectives of \({\textit{BA}}_{539611}\) and \({\textit{SA}}_{1682}\) were calculated as \(34.350/72.910 =0.471\) and \(34.350/83.760 =0.410\), respectively. The average normalized price difference (ANPD) between \({\textit{BA}}_{539611}\) (respectively, \({\textit{SA}}_{1682}\)) and all its many opponents was \(0.609\) (respectively, \(0.504\)). Since the normalized price difference between \({\textit{BA}}_{539611}\) and \({\textit{SA}}_{1682}\) from the perspective of \({\textit{BA}}_{539611}\) (respectively, \({\textit{SA}}_{1682}\)) was smaller than the ANPD between \({\textit{BA}}_{539611}\) (respectively, \({\textit{SA}}_{1682}\)) and all its many opponents, from (5) (respectively, (8)) (Sect. 2.2), in the next round \(t=1\), \({\textit{SA}}_{1682}\) (respectively, \({\textit{BA}}_{539611}\)) was selected as a viable option of \({\textit{BA}}_{539611}\) (respectively, \({\textit{SA}}_{1682}\)). At \(t=1\), by the conflict rule of the STDMC protocol, the bargaining between \({\textit{BA}}_{539611}\) (respectively, \({\textit{SA}}_{1682}\)) and all its non-viable options ended in a conflict and \({\textit{BA}}_{539611}\) (respectively, \({\textit{SA}}_{1682}\)) ignored all non-viable options when calculating the ANPD. At \(t=1\), the ANPD between \({\textit{BA}}_{539611}\) (respectively, \({\textit{SA}}_{1682}\)) and all its viable options was \(0.532\) (respectively, \(0.413\)). From (1) and (2) (respectively, (7)) (Sect. 2.2), the price proposal of \({\textit{BA}}_{539611}\) (respectively, \({\textit{SA}}_{1682}\)) at \(t=1\) was calculated as \(59.520+\left(0.532\times 34.350 \right)=77.794\) (respectively, \(93.870-\left(0.413\times 34.350 \right)=79.683\)). A series of simultaneous proposals (SPs) by \({\textit{BA}}_{539611}\) and \({\textit{SA}}_{1682}\) is shown in Table

Table 1 Simultaneous-move bargaining of a buyer-seller pair in a seller-favorable market

1.

Performance measure: The average utility of agents that reached agreements was used as the performance measure. The utility of each BA was calculated using the utility function \({U}^{x}\) defined in (9) and (10) in Sect. 2.2. The utility of each SA was calculated in a similar way. Although the generalized equations in (9) and (10) enable agents to use different scales and origins, for the purpose of the study, the level of satisfaction of each agent for the bargaining outcome was measured on the scale of 1 (least satisfied) to 10 (most satisfied). For BAs, this was done by setting \({\alpha }_{x}=9\) and \({\beta }_{x}=1\) in (9) such that \({U}^{x}\left({P}_{ag}\right)=9[\left( \textit {RP}_{x}-{P}_{ag}\right)/\left(\textit{RP}_{x}-\textit{IP}_{x}\vphantom{{P}_{ag}}\right)]+1\). For example, since \(\textit{{BA}}_{539611}\) with \(\left[\textit{IP}_{B539611}, \textit{RP}_{B539611}\right]=[\mathrm{59.520,9}0.011]\) reached an agreement with \(\textit{SA}_{1682}\) at the price of \(\textit{P}_{ag}=78.858\), the utility of \(\textit{BA}_{539611}\) was \(9\left[\left(90.011-78.858)/(90.011-59.520\right)\right]+1=4.292\). The utility of \(\textit{SA}_{1682}\) with \(\left[\textit{RP}_{S1682},\textit{IP}_{S1682}\right]=[\mathrm{47.112,93.870}]\) was \(9\left[\left(78.858-47.112)/(93.870-47.112\right)\right]+1=7.110\).

Numerical results: Numerical results for seller-favorable, balanced, and buyer-favorable fog resource markets are summarized in Fig. 

Fig. 1
figure 1

Agents’ average utilities

1. In seller-favorable fog resource markets, since there were more BAs than SAs, there was a higher probability that each SA received price proposals that were closer to its own price proposal and hence, SAs had a higher chance to achieve higher utilities than BAs if agreements were reached. For example, it can be observed in Table 1 that at each round, the ANPD between \(\textit{SA}_{1682}\) and all its viable options was smaller than that between \(\textit{BA}_{539611}\) and all its viable options. Consequently, \(\textit{SA}_{1682}\) made smaller concessions than \(\textit{BA}_{539611}\) and obtained a higher utility than \(\textit{BA}_{539611}\) when an agreement was reached. On the contrary, in buyer-favorable fog resource markets, BAs made smaller concessions and achieved higher average utilities than SAs. The numerical results are consistent with the specification of the VO strategy in Sect. 2.2 that a smaller (respectively, larger) ANPD between an agent and all its viable options confers more (respectively, less) bargaining power. In a balanced fog resource market, since there was an equal number of BAs and SAs, both BAs and SAs generally achieved moderate utilities.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sim, K.M. An Incentive-Compatible and Computationally Efficient Fog Bargaining Mechanism. Comput Econ 62, 1883–1918 (2023). https://doi.org/10.1007/s10614-022-10324-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10614-022-10324-9

Keywords

Navigation