Online Supplement to ‘Myopic Allocation Policy with Asymptotically Optimal Sampling Rate’

This document is the Online Supplement to ‘Myopic Allocation Policy with Asymptotically Optimal Sampling Rate,’ to be published in the IEEE Transactions of Automatic Control in 2017.

Asymptotically optimal cooperative wireless networks without constellation expansion

In this work, we construct a unified family of cooperative diversity coding schemes for implementing the orthogonal amplify-and-forward and the orthogonal selection-decode-and-forward strategies in cooperative wireless networks. We show that, as the number of users increases, these schemes meet the corresponding optimal high-SNR outage region, and do so with minimal order of signaling complexity. This is an improvement over all outage-optimal schemes which impose exponential increases in signaling complexity for every new network user. Our schemes, which are based on commutative algebras of normal matrices, satisfy the outage-related information theoretic criteria, the duplex-related coding criteria, and maintain reduced signaling, encoding and decoding complexities

Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs

For a family/sequence of Space-Time Block Codes (STBCs) C1, C2,⋯, with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use (cspcu), i = 1,2,⋯, the asymptotic normalized rate is defined as limi→∞ Ri/Ni. A family of STBCs is said to be asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a non-zero fraction of the number of transmit antennas, and the family of STBCs is said to be asymptotically-optimal if the asymptotic normalized rate is 1, which is the maximum possible value. In this paper, we construct a new class of full-diversity STBCs that have the least maximum-likelihood (ML) decoding complexity among all known codes for any number of transmit antennas N>;1 and rates R>;1 cspcu. For a large set of (R,N) pairs, the new codes have lower ML decoding complexity than the codes already available in the literature. Among the new codes, the class of full-rate codes (R=N) are asymptotically-optimal and fast-decodable, and for N>;5 have lower ML decoding complexity than all other families of asymptotically-optimal, fast-decodable, full-diversity STBCs available in the literature. The construction of the new STBCs is facilitated by the following further contributions of this paper: (i) Construction of a new class of asymptotically-good, full-diversity multigroup ML decodable codes, that not only includes STBCs for a larger set of antennas, but also either matches in rate or contains as a proper subset all other high-rate or asymptotically-good, delay-optimal, multigroup ML decodable codes available in the literature. (ii) Construction of a new class of fast-group-decodable codes (codes that combine the low ML decoding complexity properties of multigroup ML decodable codes and fast-decodable codes) for all even number of transmit antennas and rates 1 <; R ≤ 5/4.- - (iii) Given a design with full-rank linear dispersion matrices, we show that a full-diversity STBC can be constructed from this design by encoding the real symbols independently using only regular PAM constellations.

An asymptotically optimal push-pull method for multicasting over a random network

We consider multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected edges whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate.

Államadósság, optimális politika, finanszírozás (State Debt, Optimal Policy, and Financing)

A fejlett ipari országoknak is az államadósság csökkentése vagy akár szinten tartása okozza az egyik legfontosabb gazdaságpolitikai dilemmát. Az euróövezet tagállamai esetében is ez a kritérium tűnik a legkevésbé teljesíthetőnek, de Japán és az Egyesült Államok is leküzdhetetlennek tűnő államadóssággal birkózik. A tanulmány rövid áttekintést ad néhány meghatározó közgazdasági megközelítésről, amelyek az államadósság szintjének hosszú távú alakulása mögött meghúzódó tényezőket, gazdaságpolitikai lépéseket magyarázzák. Végül az elméletek alapján tanulságokat fogalmaz meg a magyar államadósság kezelését illetően az 1990–2010 közötti folyamatok ismeretében. _____ The macroeconomic developments of the last decade have confirmed that one of the most important dilemmas that even developed economies have to face is the reduction or even sustaining of the state debt. In case of the eurozone member states this criterion is the most difficult to be accomplished, furthermore the United States and Japan are among the global powers that have to cope with state debts which seems to be insurmountable. The aim of this paper is to provide a brief overview of some decisive economic approaches (Barro [1979], Lucas and Stokey [1983], Marcet and Scott [2007], Martin [2009] etc.) that explain the factors behind the formation of long-run state debt level and economic policy measures accompanying state debt management. The paper also attempts to draw some lessons for the Hungarian state debt management in view of the 1990-2010 processes.

Sensitivity Analysis of Some Applied Probability Models

2000 Mathematics Subject Classi cation: Primary 90C31. Secondary 62C12, 62P05, 93C41.

License scheme : an optimal waste management policy under asymmetric information

A system requiring a waste management license from an enforcement agency has been introduced in many countries. A license system is usually coupled with fines, a manifest, and a disposal tax. However, these policy devices have not been integrated into an optimal policy. In this paper we derive an optimal waste management policy by using those policy devices. Waste management policies are met with three difficult problems: asymmetric information, the heterogeneity of waste management firms, and non-compliance by waste management firms and waste disposers. The optimal policy in this paper overcomes all three problems.

Optimal maintenance policy of a machine subject to failure

Optimal maintenance policies for a machine with degradation in performance with age and subject to failure are derived using optimal control theory. The optimal policies are shown to be, normally, of bang-coast nature, except in the case when probability of machine failure is a function of maintenance. It is also shown, in the deterministic case that a higher depreciation rate tends to reverse this policy to coast-bang. When the probability of failure is a function of maintenance, considerable computational effort is needed to obtain an optimal policy and the resulting policy is not easily implementable. For this case also, an optimal policy in the class of bang-coast policies is derived, using a semi-Markov decision model. A simple procedure for modifying the probability of machine failure with maintenance is employed. The results obtained extend and unify the recent results for this problem along both theoretical and practical lines. Numerical examples are presented to illustrate the results obtained.

Optimal forwarding in delay tolerant networks with multiple destinations

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the packet and the number of destinations that have received the packet. We formulate the problem as a controlled continuous time Markov chain and derive the optimal closed loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ODE (i.e., fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed loop policy.

SEP-Optimal Transmit Power Policy for Peak Power and Interference Outage Probability Constrained Underlay Cognitive Radios

In underlay cognitive radio (CR), a secondary user (SU) can transmit concurrently with a primary user (PU) provided that it does not cause excessive interference at the primary receiver (PRx). The interference constraint fundamentally changes how the SU transmits, and makes link adaptation in underlay CR systems different from that in conventional wireless systems. In this paper, we develop a novel, symbol error probability (SEP)-optimal transmit power adaptation policy for an underlay CR system that is subject to two practically motivated constraints, namely, a peak transmit power constraint and an interference outage probability constraint. For the optimal policy, we derive its SEP and a tight upper bound for MPSK and MQAM constellations when the links from the secondary transmitter (STx) to its receiver and to the PRx follow the versatile Nakagami-m fading model. We also characterize the impact of imperfectly estimating the STx-PRx link on the SEP and the interference. Extensive simulation results are presented to validate the analysis and evaluate the impact of the constraints, fading parameters, and imperfect estimates.

Optimal Forwarding in Delay-Tolerant Networks With Multiple Destinations

We study the tradeoff between delivery delay and energy consumption in a delay-tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the message and the number of destinations that have received the message. We formulate the problem as a controlled continuous-time Markov chain and derive the optimal closed-loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ordinary differential equation (ODE) (i.e., a deterministic fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open-loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed-loop policy.

Optimal fiscal policy in a multisector model with minimum expenditure requirements

This paper investigates optimal fiscal policy in a static multisector model. A Ramsey type planner chooses tax rates on each good type as well as spending levels on each good type subject to an exogenous total expenditure constraint and requirements that some minimum amount of spending be undertaken in each sector. It is shown that optimal policy does not equally spend in each sector but instead results in one of the minimum expenditure constraints binding.

Optimal Fiscal Policy with Rationing in the Labor Market

Published as an article in: Topics in Macroeconomics, 2005, vol. 5, issue 1, article 17.

Optimal exchange rate policy, optimal incomplete taxation and business cycles

Implementation and collapse of exchange rate pegging schemes are recur- rent events. A currency crisis (pegging) is usually followed by an economic downturn (boom). This essay explains why a benevolent government should pursue Þscal and monetary policies that lead to those recurrent currency crises and subsequent periods of pegging. It is shown that the optimal policy induces a competitive equilibrium that displays a boom in periods of below average de- valuation and a recession in periods of above average devaluation. A currency crisis (pegging) can be understood as an optimal policy answer to a recession (boom).