An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games

An algebraic model generalizing submodular polytopes is presented, where modular functions on partially ordered sets take over the role of vectors in ${\mathbb R}^n$. This model unifies various generalizations of combinatorial models in which the greedy algorithm and the Monge algorithm are successful and generalizations of the notions of core and Weber set in cooperative game theory. As a further application, we show that an earlier model of ours as well as the algorithmic model of Queyranne, Spieksma and Tardella for the Monge algorithm can be treated within the framework of usual matroid theory (on unordered ground-sets), which permits also the efficient algorithmic solution of the intersection problem within this model. \u

Towards Assume-Guarantee Profiles for Autonomous Vehicles

Rules or specifications for autonomous vehicles are currently formulated on a case-by-case basis, and put together in a rather ad-hoc fashion. As a step towards eliminating this practice, we propose a systematic procedure for generating a set of supervisory specifications for self-driving cars that are 1) associated with a distributed assume-guarantee structure and 2) characterizable by the notion of consistency and completeness. Besides helping autonomous vehicles make better decisions on the road, the assume-guarantee contract structure also helps address the notion of blame when undesirable events occur. We give several game-theoretic examples to demonstrate applicability of our framework

Stable Homology as an Indicator of Manifoldlikeness in Causal Set Theory

We present a computational tool that can be used to obtain the "spatial" homology groups of a causal set. Localisation in the causal set is seeded by an inextendible antichain, which is the analog of a spacelike hypersurface, and a one parameter family of nerve simplicial complexes is constructed by "thickening" this antichain. The associated homology groups can then be calculated using existing homology software, and their behaviour studied as a function of the thickening parameter. Earlier analytical work showed that for an inextendible antichain in a causal set which can be approximated by a globally hyperbolic spacetime region, there is a one parameter sub-family of these simplicial complexes which are homological to the continuum, provided the antichain satisfies certain conditions. Using causal sets that are approximated by a set of 2d spacetimes our numerical analysis suggests that these conditions are generically satisfied by inextendible antichains. In both 2d and 3d simulations, as the thickening parameter is increased, the continuum homology groups tend to appear as the first region in which the homology is constant, or "stable" above the discreteness scale. Below this scale, the homology groups fluctuate rapidly as a function of the thickening parameter. This provides a necessary though not sufficient criterion to test for manifoldlikeness of a causal set.Comment: Latex, 46 pages, 43 .eps figures, v2 numerous changes to content and presentatio

Dense ideals and cardinal arithmetic

From large cardinals we show the consistency of normal, fine, $\kappa$-complete $\lambda$-dense ideals on $\mathcal{P}_\kappa(\lambda)$ for successor $\kappa$. We explore the interplay between dense ideals, cardinal arithmetic, and squares, answering some open questions of Foreman

Towards Assume-Guarantee Profiles for Autonomous Vehicles

Rules or specifications for autonomous vehicles are currently formulated on a case-by-case basis, and put together in a rather ad-hoc fashion. As a step towards eliminating this practice, we propose a systematic procedure for generating a set of supervisory specifications for self-driving cars that are 1) associated with a distributed assume-guarantee structure and 2) characterizable by the notion of consistency and completeness. Besides helping autonomous vehicles make better decisions on the road, the assume-guarantee contract structure also helps address the notion of blame when undesirable events occur. We give several game-theoretic examples to demonstrate applicability of our framework