We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect information typically increase the game size exponentially. Our construction avoids such a blow-up by using imperfect information to realise succinct counters which cover a range exponentially larger than their size. In particu...

Imperfect recall games remain an unexplored part of the game theory, even though recent results in abstraction algorithms show that the imperfect recall might be the key to solving the immense games found in the real world efficiently. Our research objective is to develop the first algorithm capable of outperforming the state-of-the-art solvers applied directly to perfect recall games, by creat...

The analytical bit error rate of hierarchical quadra5 ture amplitude modulation formats, which include uniform and 6 nonuniform constellations, over flat Rayleigh fading environments 7 is studied in this paper. The analysis takes into account the effect 8 of imperfect channel estimation and considers diversity reception 9 with both independent identically and nonidentically distributed 10 chann...

Loss of IP packets occurring as a result of imperfect local error correction is one of the major reasons for TCP performance degradation in wireless networks. These losses are misinterpreted by TCP senders as congestion indications and subsequently lead to the sharp decrease of the sending rate. In addition to wireless losses, packets can be lost as a result of buffer overflows at the IP layer....

This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state information at receivers (CSIR) is considered in two scenarios of perfect and imperfect CSIR. In the imperfect CSIR case, we consider a more practical assumption of...