Thesis (Ph. D.)--University of Oxford, 1989. / Includes bibliographical references (leaves [310]-319).

Thesis (Ph. D.)--University of California, Los Angeles, 1992. / Vita. Includes bibliographical references (leaves 240-248).

Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 178-183).

No description available.

We present a study of conflict from an economic perspective. We start by reviewing the approach to conflict in the economic sciences. We model conflict as a process of allocation of resources into two main technologies, production and appropriation. Then we complement this framework by allowing participants to negotiate. We introduce models of bargaining with complete and incomplete information. We incorporate the cost of conflict and this ensures that negotiated settlements always produce a more efficient outcome. The possibility of conflict arises as a result of incomplete information, which takes the form of informational asymmetry about the cost of conflict. We find endogenous war equilibrium outcomes and compare the outcome of optimal resource equilibria with arbitrary non-equilibria allocations. We also present some empirical evidence in the literature supporting the choice of utility models of conflict and present new results showing support for our propositions.

Next generation wireless networks are expected to provide high data rate and satisfy the Quality-of-Service (QoS) constraints of the users. A significant component of achieving these goals is to increase the effi ciency of wireless networks by either optimizing current architectures or exploring new technologies which achieve that. The latter includes revisiting technologies which were previously proposed, but due to a multitude of reasons were ignored at that time. One such technology is relaying which was initially proposed in the latter half of the 1960s and then was revived in the early 2000s. In this dissertation, we study relaying in conjunction with resource allocation to increase the effi ciency of wireless networks. In this regard, we differentiate between conventional relaying and relaying with buffers. Conventional relaying is traditional relaying where the relay forwards the signal it received immediately. On the other hand, in relaying with buffers or buffer-aided relaying as it is called, the relay can store received data in its buffer and forward it later on. This gives the benefit of taking advantage of good channel conditions as the relay can only transmit when the channel conditions are good. The dissertation starts with conventional relaying and considers the problem of minimizing the total consumed power while maintaining system QoS. After upper bounding the system performance, more practical algorithms which require reduced feedback overhead are explored. Buffer-aided relaying is then considered and the joint user-and-hop scheduler is introduced which exploits multi-user diversity (MUD) and 5 multi-hop diversity (MHD) gains together in dual-hop broadcast channels. Next joint user-and-hop scheduling is extended to the shared relay channel where two source-destination pairs share a single relay. The benefits of buffer-aided relaying in the bidirectional relay channel utilizing network coding are then explored. Finally, a new transmission protocol for overlay cognitive radios is derived. This protocol utilizes relays with buffers, requires only causal knowledge of the primary's message at the secondary and incentivizes the primary to cooperate with the secondary and share its codebook.

Indiana University-Purdue University Indianapolis (IUPUI) / Location Allocation, rooted in Operations Research and Mathematical programming, allows real world problems to be solved using optimization (based on mathematics and science) and equity principles (based on ethics). Finding nearest facilities for everyone simultaneously is a task solved by numerical and algebraic solutions. Bikeshare as a public good requires equitable allocation of bikeshare resources. Distance, as an impediment, can be minimized using location allocation algorithms. Since location allocation of this kind involves large numbers, sophisticated algorithms are needed to solve them due to their combinatorically explosive nature (i.e. as ‘n’ rises, solution time rises at least exponentially – sometimes called ‘Non Polynomial Time-Hard’ problems). Every day, researchers are working to improve such algorithms, since faster and better solutions can improve such algorithms and in turn help improve our daily lives.

The purpose of this work has been to generate a method by which an automobile tire manufacturer can optimally allocate its weekly production ticket to its automatic tire-curing presses. The problem is of interest for the reason that the value of the objective function is markedly affected by the relative locations of tires amongst themselves. This consideration has negated the possibility of a solution being effected by the application of an algorithm for the classical linear assignment problem. In this work the problem has been formulated and solved as a quadratic assignment problem. The logic of this method of solution has been programmed and subsequently used to solve example problems, the results of which are extremely encouraging. / Thesis / Master of Engineering (MEngr)

<p> This thesis examines the allocation and relative efficiency of the agricultural labour input in North Grimsby Township. The relative efficiency of the labour input is determined by the construction of an Index of Labour Efficiency, in which the actual labour input is compared with the labour input requirement for the farm as determined from studies undertaken by the Ontario Department of Agriculture. Certain normative hypotheses are tested, relating elements of the farm economic structure and the physical environment to the Labour Efficiency Index.</p> / Thesis / Master of Arts (MA)

No description available.