Efficient Strategy-Proof Allocation Functions in Linear Production Economies

In a linear production model, we characterize the class of efficient and strategy-proof allocation functions, and the class of efficient and coalition strategy-proof allocation functions. In the former class, requiring equal treatment of equals allows us to identify a unique allocation function. This function is also the unique member of the latter class which satisfies uniform treatment of uniforms.

Apuntes para la biografía del exmo. Sr. D. Lucas Alaman, Secretario de Estado y del Despacho de Relaciones Esteriores

UANL

Strategy-proof tie-breaking

We study a general class of priority-based allocation problems with weak priority orders and identify conditions under which there exists a strategy-proof mechanism which always chooses an agent-optimal stable, or constrained efficient, matching. A priority structure for which these two requirements are compatible is called solvable. For the general class of priority-based allocation problems with weak priority orders,we introduce three simple necessary conditions on the priority structure. We show that these conditions completely characterize solvable environments within the class of indifferences at the bottom (IB) environments, where ties occur only at the bottom of the priority structure. This generalizes and unifies previously known results on solvable and unsolvable environments established in school choice, housing markets and house allocation with existing tenants. We show how the previously known solvable cases can be viewed as extreme cases of solvable environments. For sufficiency of our conditions we introduce a version of the agent-proposing deferred acceptance algorithm with exogenous and preference-based tie-breaking.

«Constrained-optimal strategy-proof assignment: beyond the groves mechanisms»

A single object must be allocated to at most one of n agents. Money transfers are possible and preferences are quasilinear. We offer an explicit description of the individually rational mechanisms which are Pareto-optimal in the class of feasible, strategy-proof, anonymous and envy-free mechanisms. These mechanisms form a one-parameter infinite family; the Vickrey mechanism is the only Groves mechanism in that family.

Strategy-proof preference aggregation

An aggregation rule maps each profile of individual strict preference orderings over a set of alternatives into a social ordering over that set. We call such a rule strategyproof if misreporting one’s preference never produces a social ordering that is strictly between the original ordering and one’s own preference. After describing a few examples of manipulable rules, we study in some detail three classes of strategy-proof rules: (i)rules based on a monotonic alteration of the majority relation generated by the preference profile; (ii)rules improving upon a fixed status-quo; and (iii) rules generalizing the Condorcet-Kemeny aggregation method.

An algebraic proof of Iitaka's conjecture C2,1

We give a proof of Iitaka's conjecture C2,1 using only elementary methods from algebraic geometry.

Patent DE10 2004 037 519 B4 “Sensor Process and Device for Determining a Physical Value“. A Proof of Concept

At present, a fraction of 0.1 - 0.2% of the patients undergoing surgery become aware during the process. The situation is referred to as anesthesia awareness and is obviously very traumatic for the person experiencing it. The reason for its occurrence is mostly an insufficient dosage of the narcotic Propofol combined with the incapability of the technology monitoring the depth of the patient’s anesthetic state to notice the patient becoming aware. A solution can be a highly sensitive and selective real time monitoring device for Propofol based on optical absorption spectroscopy. Its working principle has been postulated by Prof. Dr. habil. H. Hillmer and formulated in DE10 2004 037 519 B4, filed on Aug 30th, 2004. It consists of the exploitation of Intra Cavity Absorption effects in a two mode laser system. In this Dissertation, a two mode external cavity semiconductor laser, which has been developed previously to this work is enhanced and optimized to a functional sensor. Enhancements include the implementation of variable couplers into the system and the implementation of a collimator arrangement into which samples can be introduced. A sample holder and cells are developed and characterized with a focus on compatibility with the measurement approach. Further optimization concerns the overall performance of the system: scattering sources are reduced by re-splicing all fiber-to-fiber connections, parasitic cavities are eliminated by suppressing the Fresnel reflexes of all one fiber ends by means of optical isolators and wavelength stability of the system is improved by the implementation of thermal insulation to the Fiber Bragg Gratings (FBG). The final laser sensor is characterized in detail thermally and optically. Two separate modes are obtained at 1542.0 and 1542.5 nm, tunable in a range of 1nm each. Mode Full Width at Half Maximum (FWHM) is 0.06nm and Signal to Noise Ratio (SNR) is as high as 55 dB. Independent of tuning the two modes of the system can always be equalized in intensity, which is important as the delicacy of the intensity equilibrium is one of the main sensitivity enhancing effects formulated in DE10 2004 037 519 B4. For the proof of concept (POC) measurements the target substance Propofol is diluted in the solvents Acetone and DiChloroMethane (DCM), which have been investigated for compatibility with Propofol beforehand. Eight measurement series (two solvents, two cell lengths and two different mode spacings) are taken, which draw a uniform picture: mode intensity ratio responds linearly to an increase of Propofol in all cases. The slope of the linear response indicates the sensitivity of the system. The eight series are split up into two groups: measurements taken in long cells and measurements taken in short cells.

A Virtual Machine for a Type-omega Denotational Proof Language

In this thesis, I designed and implemented a virtual machine (VM) for a monomorphic variant of Athena, a type-omega denotational proof language (DPL). This machine attempts to maintain the minimum state required to evaluate Athena phrases. This thesis also includes the design and implementation of a compiler for monomorphic Athena that compiles to the VM. Finally, it includes details on my implementation of a read-eval-print loop that glues together the VM core and the compiler to provide a full, user-accessible interface to monomorphic Athena. The Athena VM provides the same basis for DPLs that the SECD machine does for pure, functional programming and the Warren Abstract Machine does for Prolog.

En Lluquet d'Eivissa : llegenda d'Eivissa i Formentera. 'El peque??o Lucas de Ibiza : leyenda de Ibiza y Formentera'

Resumen tomado de la publicaci??n

Nombramiento de beca a favor de Lucas Camacho y Guzmán

1. Petición de una beca de colegial formal en el Colegio Mayor del Rosario para Lucas Camacho por parte de su tío Nicolas Guzmán. 2. Decreto proveído por el presidente de la Real Audiencia de Santafé 3. Informe del Rector sobre las cualidades que acreditan a Lucas Camacho para obtener la beca 3. Nombramiento de beca a favor de Lucas Camacho. Siendo rector interino, el vicerrector doctor don Jacinto Roque Flórez de Acuña.

Juicio contra el testamento de Francisco Lucas Pérez Manrique de Lara por parte Luis Ignacio del Castillo y Caicedo

Luis Ignacio del Castillo pide a la Real Audiencia la adjudicación de parte de los bienes del difunto Francisco Lucas Pérez Manrique canónigo de la Catedral de Santafé, a cambio él se haría cargo de un principal de capellanía (préstamo) sobre la casa que habitaba y que pertenecía al dicho Francisco Lucas Pérez. Se incluye un inventario de los bienes con sus respectivos valores y la aceptación de la solicitud por parte del Albacea testamentario Francisco Javier Tello.

Juicio contra el testamento de Francisco Lucas Pérez Manrique de Lara por parte de Francisco José de Olaya

Juicio en contra del testamento de Francisco Lucas Pérez Manrique sobre dinero que quedó debiendo a Santiago de Linares párroco de Quebrada negra. Los albaceas de Santiago de Linares presentan declaraciones juramentadas sobre la existencia de la mencionada deuda para que se pague de los bienes del difunto Francisco Lucas Pérez Manrique. Al final del expediente se acepta la demanda y se ordena el pago.

Cuentas presentadas por Francisco Javier Tello sobre el testamento de Francisco Lucas Pérez Manrique

Cuentas presentadas por Francisco Javier Tello albacea de Francisco Lucas Pérez Manrique, sobre el cumplimiento de las disposiciones del testamento del mencionado Pérez Manrique. Incluye información sobre el remate de los bienes, pago y cobro de deudas, pago de herencias, gastos del funeral, y pago de capellanías, limosnas, misas y donaciones.

Cuentas de los principales, réditos y capellanías del difunto Francisco Lucas Pérez Manrique de Lara y Ospina

Listado de los principales, réditos y capellanías que le pertenecían al difunto Francisco Lucas Pérez Manrique. Se exponen las cantidades de dinero de dichas transacciones y sus destinatarios.

Reclamo contra el testamento de Francisco Lucas Pérez Manrique por María Josefa de Caicedo

Expediente de reclamo de María Josefa de Caicedo viuda del II Marqués de San Jorge, por cantidad de dinero que le debía el difunto José Pérez Manrique a sus hijos, de quien era apoderada. Contiene copia del poder para testar concedido por José Pérez M. concedido a su hermano Francisco Pérez, así como su testamento, en el que dejó como herederos universales a sus hermanos Francisco y María Eduviges Manrique. También se incluye una copia del poder para testar y del testamento de Francisco Pérez Manrique, que dejó la totalidad de sus bienes al Colegio Mayor del Rosario. El expediente termina con la resolución de la Real Audiencia, concediéndole a María Josefa de Caicedo la razón para cobrar la cantidad que se le adeudaba.