Despite the large amount of theoretical work done on non-constituent coordination during the last two decades, many computational systems still treat coordination using adapted parsing strategies, in a similar fashion to the SYSCONJ system developed for ATNs. This paper reviews the theoretical literature, and shows why many of the theoretical accounts actually have worse coverage than accounts ...

Contracts often take the form of options: oil fields can be abandoned, planning permission may go unused, and acquired firms can be liquidated. We consider a seller who auctions a dynamic option among N agents. After the auction, the economy evolves and the winning bidder chooses both if and when to execute the option. The revenue-maximising auction consists of an up-front bid and a contingent ...

Dynamic packaging has been introduced as an innovative technology allowing for the automated online configuration and assembling of packaged travel products for individual customers. While dynamic packaging has been widely accepted by customers in UK and US markets, the possible strategic impacts enabled by dynamic packaging technologies are still uncertain. This article provides a study of the...

In this paper, a structural damage identification method (SDIM) is developed for plate-like structures. This method is derived using dynamic equation of undamaged/damaged plate, in which local change in flexural rigidity is characterized utilizing a damage distribution function. The SDIM requires to modal data in the intact state and frequency response of damage state where most of vibration ba...

We provide necessary and sufficient conditions for a dynamically consistent agent always to prefer more informative signals (in single-agent problems). These conditions do not imply recursivity, reduction or independence. We provide a simple definition of dynamically consistent behavior, and we discuss whether an intrinsic information lover (say, an anxious person) is likely to be dynamically c...

We extend propositional dynamic logic (PDL) with variables ranging over an infinite domain. This extension, called parametrized PDL or PPDL for short, is interpreted over parametrized transitions systems whose edges are labeled with letters or variables and whose states are labeled with non-parametrized propositions. We show that the satisfiability problem for PPDL is decidable. We apply these ...

We examine the paradox of the surprise examination using dynamic epistemic logic. This logic contains means of expressing epistemic facts as well as the effects of learning new facts, and is therefore a natural framework for representing the puzzle. We discuss a number of different interpretations of the puzzle in this context, and show how the failure of principle of success, that states that ...

Dynamic incentives, where incentives to repay are generated by granting access to future loans, is one of the methodologies used by microfinance institutions (MFIs). In this paper, I present a model of dynamic incentives where lenders are uncertain over how much borrowers value future loans. Loan terms are determined endogenously, and loans become more favorable as the probability of default be...

We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property.