This paper presents an axiomatic approach to negotiation protocol analysis. We consider a negotiation procedure as multiple stages of mutual belief revision. A set of postulates in AGM-style of belief revision are proposed to specify rational behavior of negotiation. An explicit construction of negotiation function is given in which negotiation process is viewed as the interaction of two iterat...

In this paper, we provide an axiomatic characterization of social welfare functions for uncertain incomes. Our most general result is that a small number of reasonable assumptions regarding welfare orderings under uncertainty rule out pure ex ante as well as pure ex post evaluations. Any social welfare function that satisfies these axioms should lie strictly between the ex ante and the ex post ...

We prove that a set of weak solutions of the nonlinear Volterra integral equation has the Kneser property. The main condition in our result is formulated in terms of axiomatic measures of weak noncompactness.

The covariant Maxwell equations are derived from the continuity equation for the electric charge. This result provides an axiomatic approach to Maxwell’s equations in which charge conservation is emphasized as the fundamental axiom underlying these equations.

This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules, provide an axiomatic characterization of this class and, in particular, show that counting rules are consistent. Building upon this result, we axiomatically characterize three import...

Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been given in operational style. A Csp semantics in axiomatic style, however, has been considered problematic in the literature. In this paper we present a sound and complete axiomatic semantics for Csp with unbounded nondet...

We present several results concerning deductive completeness of the simply typed λcalculus with constants and equational axioms. First, we prove deductive completeness of the calculus with respect to standard semantics for axioms containing neither free nor bound occurrences of higher-order variables. Using this result, we analyze some fundamental deductive and semantic properties of axiomatic ...

Most contributions in axiomatic bargaining are phrased in the space of utilities. This comes in sharp contrast with standards in most other branches of economic theory. The present paper shows how Nash’s original axiomatic system can be rephrased in a natural class of economic environments with lotteries, and how his uniqueness result can be recovered, provided one completes the system with a p...