In this work we introduce an intermediate setting between quantum nonlocality and communication complexity problems. More precisely, we study the value of XOR games G when Alice and Bob are allowed to use a limited amount of one-way classical communication ωo.w.−c(G) (resp. one-way quantum communication ω * o.w.−c (G)), where c denotes the number of bits (resp. qubits). The key quantity here is the quotient ω * o.w.−c (G)/ωo.w.−c(G). We provide a universal way to obtain Bell inequality violations of general Bell functionals from XOR games for which the quotient ω * o.w.−c (G)/ωo.w.−2c(G) is larger than 1. This allows, in particular, to find (unbounded) Bell inequality violations from communication complexity problems in the same spirit as the recent work by Buhrman et al. (2016).We also provide an example of a XOR game for which the previous quotient is optimal (up to a logarithmic factor) in terms of the amount of information c. Interestingly, this game has only polynomially many inputs per player. For the related problem of separating the classical vs quantum communication complexity of a function, the known examples attaining exponential separation require exponentially many inputs per party.We will refer to one such B as a Bell functional. Then, one can define ω(B) = sup P ∈L | B, P | and ω * (B) = sup P ∈Q | B, P | , 1 2 MARIUS JUNGE, CARLOS PALAZUELOS, AND IGNACIO VILLANUEVAwhere L is the set of classical bipartite probability distributions and Q is the set of quantum bipartite probability distributions; that is, those probability distributions that Alice and Bob can generate when they share an unlimited amount of entanglement. The key ratio to quantify quantum nonlocality is ω * (B)/ω(B) and we say that there exists a Bell inequality violation if this quotient is strictly larger than 1.Another relevant context where quantum resources perform better than classical resources is communication complexity. In the usual task [9] two separate parties, Alice and Bob, have to compute a binary function f (x, y) of two predicates x ∈ X, y ∈ Y. Alice only has access to x, whereas Bob only has access to y. They are assumed to have unlimited computational resources, and they can interchange messages until they are able to compute the function. The randomized communication complexity of f is defined to be the minimum number of bits (or qubits in the quantum case) interchanged between Alice and Bob required for a randomized algorithm in order to compute correctly f (x, y) with probability larger than ǫ for every possible input (x, y). We will call these numbers CC(f, ǫ) and QC(f, ǫ) respectively.In this paper we study the relation between Bell inequality violations and communication complexity problems [3], continuing the spirit of the recent paper [4], where some new implications between both contexts where uncovered. In this line, certain specific Bell inequality violations are known to lead to separation in communication complexity for certain functions [2], although we do not know of any general implication in this di...