• DocumentCode
    623944
  • Title

    Surviving in a competitive market of information providers

  • Author

    Poularakis, Konstantinos ; Tassiulas, L.

  • Author_Institution
    Dept. of Comput. & Commun. Eng., Univ. of Thessaly, Volos, Greece
  • fYear
    2013
  • fDate
    14-19 April 2013
  • Firstpage
    3273
  • Lastpage
    3278
  • Abstract
    As the processing and transport capacity of the information and communication technologies (ICT) infrastructure increased vastly the last few years, the bottleneck of the information exchange process moved to the end points of the process, i.e. the consumers and the producers of information. On one hand there is the limited time that a consumer has to access the information and on the other hand there is the minimum utility level that a provider needs to provide to the society of consumers to cover it´s investment cost. In this paper we present a novel decision model for a set of competing providers that wish to enter a market. It may happen that due to the competition, some competitors will not be able to cover their investment cost and therefore will disappear. We analyze the optimum way of forming the market, in order to maximize the aggregate utility of it. We show that this problem is NP-complete and present a linear programming rounding heuristic algorithm to solve it. Besides, we study a game where every player (provider) is to choose whether to join the market or not. We compute the price of anarchy of the game and present a heuristic algorithm that belongs to the family of best response dynamic algorithms. Systematic experiments on a real world data set have demonstrated the effectiveness of our proposed approach.
  • Keywords
    computational complexity; decision making; electronic data interchange; linear programming; ICT; NP-complete; best response dynamic algorithms; competitive market; decision model; heuristic algorithm; information and communication technologies infrastructure; information exchange process; information providers; investment cost; linear programming rounding heuristic algorithm; transport capacity; Aggregates; Conferences; Games; Heuristic algorithms; Linear programming; Nash equilibrium; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2013 Proceedings IEEE
  • Conference_Location
    Turin
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4673-5944-3
  • Type

    conf

  • DOI
    10.1109/INFCOM.2013.6567150
  • Filename
    6567150