Security Implications of Fog Computing on the Internet of Things

Recently, the use of IoT devices and sensors has been rapidly increased which also caused data generation (information and logs), bandwidth usage, and related phenomena to be increased. To our best knowledge, a standard definition for the integration of fog computing with IoT is emerging now. This integration will bring many opportunities for the researchers, especially while building cyber-security related solutions. In this study, we surveyed about the integration of fog computing with IoT and its implications. Our goal was to find out and emphasize problems, specifically security related problems that arise with the employment of fog computing by IoT. According to our findings, although this integration seems to be non-trivial and complicated, it has more benefits than the implications.Comment: 5 pages, conference paper, to appear in Proceedings of the ICCE 2019, IEEE 37th International Conference on Consumer Electronics (ICCE), Jan 11- 13, 2019, Las Vegas, NV, US

Pairing games and markets

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has has several notable structural properties. We also introduce the solution concept of pseudostable allocations and show that they are in the Demand Bargaining Set. We give a dynamic Market Procedure that reaches the Equilibrium Set in a bounded number of steps. We use elementary tools of graph theory and a representation theorem obtained here

Bankruptcy problems with interval uncertainty

In this paper, bankruptcy situations with interval data are studied. Two classical bankruptcy rules, namely the proportional rule and the rights-egalitarian rule, are extended to the interval setting. It turns out that these bankruptcy interval rules generate elements in the interval core of a related cooperative interval game.

Cooperation under Interval Uncertainty

Classification: JEL code C71Cooperative game theory;Interval uncertainty;Core;Value;Balancedness

Convex Interval Games

In this paper, convex interval games are introduced and some characterizations are given. Some economic situations leading to convex interval games are discussed. The Weber set and the Shapley value are defined for a suitable class of interval games and their relations with the interval core for convex interval games are established. A square operator is introduced which allows us to obtain interval solutions starting from classical cooperative game theory solutions. It turns out that on the class of convex interval games the square Weber set coincides with the interval core.cooperative games;interval data;convex games;the core;the Weber set;the Shapley value

Cores and Stable Sets for Interval-Valued Games

In this paper, interval-type solution concepts for interval-valued cooperative games like the interval core, the interval dominance core and stable sets are introduced and studied. The notion of I-balancedness is introduced, and it is proved that the interval core of an interval-valued cooperative game is nonempty if and only if the game is I-balanced. Relations between the interval core, the dominance core and stable sets of an interval-valued game are established.cooperative games;interval games;the core;the dominance core;stable sets

Some Characterizations of Convex Interval Games

This paper focuses on two characterizations of convex interval games using the notions of superadditivity and exactness, respectively. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of subadditivity and exactness.Cooperative interval games, convex games, big boss games, superadditive games, marginal games, exact games

Fazlur Rahman

Fazlur Rahman yang telah mengenyam pendidikan tradisional di Asia Selatan dan sekaligus modern di Eropa, pernah mengalami pertentangan yang hebat di dalam dirinya antara prisip dan nilai sistem pendidikan yang pertama dan yang belakangan. Namun pertentangan tersebut pada akhirnya justru melahirkan kekuatan tersendiri dalam diri Rahman. Suatu kekuatan untuk membangun metodologinya yang khas untuk memahami Islam, baca al-Qur\u27an. Baginya, al-Qur\u27an adalah \u27gudang yang unik bagi jawaban­jawaban terhadap semua jenis persoalan\u27 yang dihadapi Umat Islam. Ia bahkan percaya bahwa semua tradisi memerlukan revitalisasi dan pembahanaan yang konstan. Dalam upaya revitalisasi, reformasi dan revitalisasi tersebut, ia mengingatkan bahwa suatu teori atau doktrin biasa dikatakan Islam sejauh ia mengalir dari ajaran total al-Qur\u27an dan Sunnah. Gagasan-gagasan mengenai ini semua bias ditangkap dengan jelas dalam karya-karya utamanya seperti Major Themes of the Qur \u27an, Islam, Islamic Methodology in History, dan Islam and Modernity: Transformation of Intelektual Tradition. Sedangkan karya Rahman yang lain secara lengkap bisa dilihat pada bagian akhir tulisan ini.Tulisan ini mencoba mengeksplorasi gagasan Rahman, sebagai seorang neo-modemis, yang berkaitan tidak saja sejarah perkembangan dan pembentukan pemikirannya, tetapi juga metodologi yang dibangunnya untuk memahami Islam dan persoalan yang dihadapi umatnya pada masa sekarang ini secara benar dan utuh. Oleh karenanya persoalan teologis yang menjadi minat utamanya adalah persoalan yang mempunyai relevansi kekinian. Menurutnya studi tentang kebangkitan dan pembaharuan dalam Islam menunjukkan bahwa faktor moral bukannya faktor teologis yang menjadi latar depan

Aggregate efficiency in random assignment problems

We introduce aggregate efficiency (AE) for random assignments (RA) by requiring higher expected numbers of agents be assigned to their more preferred choices. It is shown that the realizations of any aggregate efficient random assignment (AERA) must be an AE permutation matrix. While AE implies ordinally efficiency, the reverse does not hold. And there is no mechanism treating equals equally while satisfying weak strategyproofness and AE. But, a new mechanism, the reservation-1 (R1), is identified and shown to provide an improvement on grounds of AE over the probabilistic serial mechanism of Bogomolnaia and Moulin (2001). We prove that R1 is weakly strategyproof, ordinally efficient, and weak envy--free. Moreover, the characterization of R1 displays that it is the probabilistic serial mechanism updated by a principle decreed by the Turkish parliament concerning the random assignment of new doctors: Modifying the axioms of Hasimoto, et. al. (2012) characterizing the probabilistic serial mechanism to satisfy this principle, fully characterizes R1

Sequencing Interval Situations and Related Games

In this paper we consider one-machine sequencing situations with interval data. We present different possible scenarioes and extend classical results on well known rules and on sequencing games to the interval setting.cooperative games;interval data;sequencing situations;convex games