Results 1 to 10 of about 757 (46)

Quantifying Shannon's Work Function for Cryptanalytic Attacks [PDF]

, 2010
Attacks on cryptographic systems are limited by the available computational resources. A theoretical understanding of these resource limitations is needed to evaluate the security of cryptographic primitives and procedures.
van Son, R. J. J. H.
core   +9 more sources

Average Weights and Power in Weighted Voting Games [PDF]

, 2020
We investigate a class of weighted voting games for which weights are randomly distributed over the standard probability simplex. We provide close-formed formulae for the expectation and density of the distribution of weight of the $k$-th largest player ...
Boratyn, Daria, Kirsch, Werner, Stolicki, Dariusz, Słomczyński, Wojciech, Życzkowski, Karol   +4 more
core   +2 more sources

Competitive division of a mixed manna [PDF]

, 2017
A mixed manna contains goods (that everyone likes) and bads (that everyone dislikes), as well as items that are goods to some agents, but bads or satiated to others. If all items are goods and utility functions are homogeneous of degree 1 and concave (
Bogomolnaia, Anna, Moulin, Hervé, Sandomirskiy, Fedor, Yanovskaya, Elena   +3 more
core   +2 more sources

Computing resource allocation in three-tier IoT fog networks: a joint optimization approach combining Stackelberg game and matching [PDF]

, 2017
Fog computing is a promising architecture to provide economical and low latency data services for future Internet of Things (IoT)-based network systems.
Bu, Shengrong, Han, Zhu, Niyato, Dusit, Xiao, Yong, Yu, F. Richard, Zhang, Huaqing   +5 more
core   +2 more sources

Physical Layer Security: Coalitional Games for Distributed Cooperation

, 2009
Cooperation between wireless network nodes is a promising technique for improving the physical layer security of wireless transmission, in terms of secrecy capacity, in the presence of multiple eavesdroppers.
Basar, Tamer, Debbah, Merouane, Han, Zhu, Hjørungnes, Are, Saad, Walid   +4 more
core   +2 more sources

Finding maxmin allocations in cooperative and competitive fair division

, 2011
We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.Comment:
Camilla Di Luca, DP Bertsekas, E Kalai, E Kalai, J Barbanel, J Barbanel, J Elton, J Legut, J Legut, LE Dubins, M Dall’Aglio, M Dall’Aglio, Marco Dall’Aglio, NZ Shor, S Boyd, SJ Brams   +15 more
core   +1 more source

Recognising Multidimensional Euclidean Preferences

, 2016
Euclidean preferences are a widely studied preference model, in which decision makers and alternatives are embedded in d-dimensional Euclidean space. Decision makers prefer those alternatives closer to them.
Peters, Dominik
core   +1 more source

Direct Proofs of Order Independence [PDF]

, 2011
We establish a generic result concerning order independence of a dominance relation on finite games. It allows us to draw conclusions about order independence of various dominance relations in a direct and simple way.Comment: 9 ...
Apt, Krzysztof R.
core   +1 more source

Utilitarian Welfare and Representation Guarantees of Approval-Based Multiwinner Rules

, 2020
To choose a suitable multiwinner voting rule is a hard and ambiguous task. Depending on the context, it varies widely what constitutes the choice of an ``optimal'' subset of alternatives.
Lackner, Martin, Skowron, Piotr
core   +2 more sources

Coalitional Games for Distributed Collaborative Spectrum Sensing in Cognitive Radio Networks

, 2009
Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent trade off between the gains in terms of probability of detection of the primary ...
Başar, Tamer, Debbah, Merouane, Han, Zhu, Hjørungnes, Are, Saad, Walid   +4 more
core   +4 more sources