142
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Performance bounds for Nash equilibria in submodular utility systems with user groups

, &
Pages 1-18 | Received 31 Aug 2017, Accepted 09 Oct 2017, Published online: 25 Oct 2017

References

  • Ahmed, S., & Atamtürk, A. (2011, June). Maximizing a class of submodular utility functions. Mathematical Programming, 128(1–2), 149–169.
  • Allen, B., Lippner, G., Chen, Y. T., Fotouhi, B., Momeni, N., Yau, S. T., & Nowak, M. A. (2017). Evolutionary dynamics on any population structure. Nature, 544, 227–230.
  • Arslan, G., Marden, J. R., & Shamma, J. S. (2007, September). Autonomous vehicle-target assignment: A game-theoretical formulation. Journal of Dynamic Systems, Measurement, and Control, 129(5), 584–596.
  • Chen, X., Gong, X., Yang, L., & Zhang, J. (2014, April). A social group utility maximization framework with applications in database assisted spectrum access. IEEE INFOCOM, 2014,1959–1967, Toronto, Canada.
  • He, J., Bresler, M., Chiang, M., & Rexford, J. (2007, June). Towards robust multi-layer traffic engineering: optimization of congestion control and routing. IEEE Journal on Selected Areas in Communications, 25(5), 868–880.
  • Jawaid, S. T., & Smith, S. L. (2015, November). Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems. Automatica, 61, 282–288.
  • Koutsoupias, E., & Papadimitriou, C. H. (2009, May). Worst-case equilibria. Computer Science Review, 3(2), 65–69.
  • La, R. J., & Anantharam, V. (2002, April). Utility-based rate control in the internet for elastic traffic. IEEE/ACM Transactions on Networking, 10(2), 272–286.
  • Liu, Y., Chong, E. K. P., & Pezeshki, A. (2016). Performance bounds for the k-batch greedy strategy in optimization problems with curvature. In: American Control Conference (Vol. 2016, pp. 7177–7182), Boston, MA.
  • Liu, Y., Chong, E. K. P., & Pezeshki, A. (in press). Performance Bounds with Curvature for Batched Greedy Optimization. Journal of Optimization Theory and Applications. arXiv:1605.03628.
  • Liu, E., Chong, E. K. P., & Scharf, L. L. (2014, April). Greedy adaptive linear compression in signal-plus-noise models. IEEE Transactions on Information Theory, 60(4), 2269–2280.
  • Nash, J. (1951). Non-cooperative games. Annals of Mathematics, 54(2), 286–295.
  • Palomar, D. P., & Chiang, M. (2007, December). Alternative distributed algorithms for network utility maximization: Framework and applications. IEEE Transactions on Automatic Control, 52(12), 2254–2269.
  • Papadimitriou, C. H. (2001). Algorithms, games, and the internet. STOC, 2001, 749–753.
  • Roughgarden, T., & Tardos, E. (2002, March). How bad is selfish routing. Journal of the ACM, 49(2), 236–259.
  • Rowaihy, H., Eswaran, S., Johnson, M., Verma, D., Bar-noy, A., Brown, T., & Porta, T. L. (2007 May 11). A survey of sensor selection schemes in wireless sensor networks. In: SPIE Defense and Security Symposium Conference on Unattended Ground, Sea, and Air Sensor Technologies and Applications (Vol. IX. p. 6562), Orlando, FL.
  • Vetta, A. (2002). Nash equilibrium in competitive societies, with applications to facility location, traffic routing and auctions. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science (pp. 416–425), Vancouver, Canada.
  • Wu, C., Xu, Y., Chen, Y., & Lu, C. (2013, March). Submodular game for distributed application allocation in shared sensor networks. In: IEEE INFOCOM 2012 (pp. 127–135).
  • Zhang, Z., Chong, E. K. P., Pezeshki, A., & Moran, W. (2016, March). String submodular functions with curvature constraints. IEEE Transactions on Automatic Control, 61(3), 601–616, Orlando, FL.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.