4 results on '"Coalitional Game Theory"'
Search Results
2. Selection of Information Streams in Social Sensing
- Author
-
Corrado Mio, Francesco Viola, Nawaf Almoosa, Jianyi Lin, and Gabriele Gianini
- Subjects
Critical Source Selection ,Social Sensing ,Computer science ,Power Index ,Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI ,020206 networking & telecommunications ,02 engineering and technology ,STREAMS ,computer.software_genre ,Settore INF/01 - INFORMATICA ,Shapley value ,Source Management ,Banzhaf Value ,Ranking ,Work (electrical) ,Coalitional Game Theory ,Power index ,0202 electrical engineering, electronic engineering, information engineering ,Redundancy (engineering) ,020201 artificial intelligence & image processing ,Data mining ,computer ,Game theory ,Shapley Value ,Selection (genetic algorithm) - Abstract
In this work we address the problem of critical source selection in social sensing. We propose an approach to the ranking of information streams, which is aware of the interdependence among streams (redundancy and synergies), of the cost of individual streams, and of the cost related to the integration of multiple streams. The method is based on the use of the Coalitional Game Theory concept of Power Index, and relies on the polynomial-time estimate of the stream sets characteristics. With respect to other works using a power index, the method takes into account that the problem has a non-trivial cost structure.
- Published
- 2020
3. Caching Games between Content Providers and Internet Service Providers
- Author
-
Yezekael Hayel, Salah Eddine Elayoubi, Vaggelis G. Douros, Eitan Altman, Orange Labs [Issy les Moulineaux], France Télécom, Laboratory of Information, Network and Communication Sciences (LINCS), Institut Mines-Télécom [Paris] (IMT)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Pierre et Marie Curie - Paris 6 (UPMC), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Models for the performance analysis and the control of networks (MAESTRO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), and Altman, Eitan
- Subjects
Computer Networks and Communications ,Status quo ,Computer science ,media_common.quotation_subject ,Digital content ,0211 other engineering and technologies ,02 engineering and technology ,Business model ,Computer security ,computer.software_genre ,01 natural sciences ,Profit (economics) ,Nash Equilibrium ,010104 statistics & probability ,symbols.namesake ,0202 electrical engineering, electronic engineering, information engineering ,Shapley value ,Coalitional game theory ,0101 mathematics ,media_common ,021103 operations research ,[INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT] ,business.industry ,020206 networking & telecommunications ,Hardware and Architecture ,Nash equilibrium ,Modeling and Simulation ,[INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT] ,symbols ,Cache ,business ,computer ,Software ,Externality ,Computer network - Abstract
International audience; We consider a scenario where an Internet Service Provider (ISP) serves users that choose digital content among M Content Providers (CP). In the status quo, these users pay both access fees to the ISP and content fees to each chosen CP; however, neither the ISP nor the CPs share their profit. We revisit this model by introducing a different business model where the ISP and the CP may have motivation to collaborate in the framework of caching. The key idea is that the ISP deploys a cache for a CP provided that they share both the deployment cost and the additional profit that arises due to caching. Under the prism of coalitional games, our contributions include the application of the Shap-ley value for a fair splitting of the profit, the stability analysis of the coalition and the derivation of closed-form formulas for the optimal caching policy. Our model captures not only the case of non-overlapping contents among the CPs, but also the more challenging case of overlapping contents; for the latter case, a non-cooperative game among the CPs is introduced and analyzed to capture the negative externality on the demand of a particular CP when caches for other CPs are deployed.
- Published
- 2017
4. Approximating the Shapley Value via Multi-Issue Decomposition
- Author
-
Soufiani, Hossein Azari, Chickering, David M., Charles, Denis X., and Parkes, David C.
- Subjects
Coalitional game theory ,Shapley value ,Machine learning ,Crowdsourcing - Abstract
The Shapley value provides a fair method for the division of value in coalitional games. Motivated by the application of crowdsourcing for the collection of suitable labels and features for regression and classification tasks, we develop a method to approximate the Shapley value by identifying a suitable decomposition into multiple issues, with the decomposition computed by applying a graph partitioning to a pairwise similarity graph induced by the coalitional value function. The method is significantly faster and more accurate than existing random-sampling based methods on both synthetic data and data representing user contributions in a real world application of crowdsourcing to elicit labels and features for classification., Engineering and Applied Sciences
- Published
- 2014
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.