An optimal sequential procedure for a buying-selling problem with independent observations

We consider a buying-selling problem when two stops of a sequence of independent random variables are required. An optimal stopping rule and the value of a game are obtained.

Buying, selling and building a home

A contract to buy or sell a home is the most important contract most people will ever make. It is crucial that the purchase or sale is made carefully and correctly. Similarly, maintaining a home and undertaking repairs or renovations can be significant aspects of life. This Chapter will explore these issues under the broad headings: • buying a home; • selling a home; and • building or renovating a home.

Buying, selling and building a home

A contract to buy or sell a home is the most important contract most people will ever make. It is crucial that the purchase or sale is made carefully and correctly. Similarly, maintaining a home and undertaking repairs or renovations can be significant aspects of life. This chapter will explore these issues under the broad headings of: • buying a home • selling a home • building or renovating a home.

RP97-43 Tax Planning When Buying or Selling a Farm

If you're like most farmers, one of your key goals is to maximize after-tax earnings. The more money left over after you've paid your farm bills land your taxes, the more you and your family will have to spend. You can increase thos enet earnings in sveral ways: by increasing production, by decreasing cost of supplies oer by finding a way to get more for your produce. But there's another way to increase your after-tax earnings. One that many farmers oculd afford to spen dmore time on: decreasing taxes. The key to avoiding unnecessary taxes is tax planning. This publication will help you do just that: plan for the future.

Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

Decisions with Impact on Energy Reduction Opportunities : Swedish manufacturers and buyers of new single-family houses

This article discusses some of the complexities of human decision-making. It aims, in particular, at relating the nature of decision-making to the illusory dichotomies of change and stability, individual actions and cultural sharing. Serving as an illustration to the discussion of the article is ongoing fieldwork in contexts of buying, selling and constructing pre-fabricated detached houses in the central Sweden, and the very specific question of how decisions to install one kind of heating-system rather than another come about. A common reductionism is to narrow down the understanding of decisions about heating systems and energy consumption to conscious choices made by individual householders. I have asked myself whether, on the contrary, anyone actually makes such decisions at all. Perhaps some of these decisions are merely outcomes of interaction between different individuals with their respective responsibilities and focuses of interest.

Gestão, território e desenvolvimento: dificuldades e perspectivas do município de Tabatinga - SP

Pós-graduação em Geografia - IGCE

"Selling/Buying"

The article belongs to the field of lexical semantics studies, associated with describing the Russian linguistic world-image. The work focuses on the universal situation of purchase and sale as reflected in the Russian language.

The Concept of ’Selling/Buying’ in the Russian Linguistic Picture of the World : from standard to sub-standard

The thesis belongs to the field of lexical semantics studies, associated with describing the Russian linguistic world-image. The research focuses on the universal situation of purchase and sale as reflected in the Russian lexical standard and sub-standard. The work deals also with subjects related to the sphere of social linguistics: the social stratification of the language, the structure of sub-standard, etc. The thesis is a contribution to the description of the Russian linguistic world-image as well as to the further elaboration of the conceptional analysis method. The results are applicable in teaching Russian as a foreign language, particularly in lexis and Russian culture and mentality studies.