-
We introduce an inquisitive semantics for a language of propositional
logic, where the interpretation of disjunction is the source of
inquisitiveness. Indicative conditionals and conditional questions are
treated on a par both syntactically and semantically. The semantics
comes with a new logical...
-
‘Possible worlds semantics’ for modal logic is a widely used
term, sometimes with ominous metaphysical connotations, but
what does this style of modeling involve today? We discuss
three main issues, using epistemic logic as a running example,
and drawing upon both mathematical results and pra...
-
We analyze the different logical components needed for analyzing
strategic interactive decision behaviour in games, and discuss new
dynamic-epistemic scenarios for 'game solution' procedures. This is
meant as a typical sample of what logic can do for games.
-
We show how relativization techniques from algebra have led
to new guarded fragments in logic that bound quantification.
We also show how guarded fragments may be see equivalently
as forms of generalized semantics that lower complexity.
Finally, we turn things around and discuss how this logic
...
-
We study different aspects of the multiagent resource allocation
problem when the objective is to find an allocation that maximizes
Nash social welfare, the product of the utilities of the individual
agents. The Nash solution is an important welfare criterion that
combines efficiency and fairnes...
-
We analyze the expressivity, succinctness, and complexity of a family
of languages based on weighted propositional formulas for the
representation of utility functions. The central idea underlying this
form of preference modeling is to associate numerical weights with
goals specified in terms of ...
-
Mixed Multi-Unit Combinatorial Auctions are auctions that allow
participants to bid for bundles of goods to buy, for bundles of goods
to sell, and for transformations of goods. The intuitive meaning of a
bid for a transformation is that the bidder is offering to produce a
set of output goods afte...
-
Simple Negotiation Schemes for Agents with Simple Preferences:
Sufficiency, Necessity and Maximality
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
Abstract:
We investigate the properties of an abstract negotiation framework
where agents autonomously negotiate over allocations of indivisible
reso...
-
We prove that the statement "All Sigma-1-2 sets of reals have the
Baire property in the eventually different topology" is equivalent to
"omega-1 is inaccessible by reals". We determine the strength of the
statement "All Delta-1-2 sets of reals have the Baire property in the
eventually different t...
-
We analyse learning as the process of conjecture-change over
time. Treating ``conjectures'' as beliefs, we link the process of
conjecture-change to doxastic update. Using this approach, we
reconstruct and analyse the temporal aspect of learning in the limit
in the context of temporal and dynamic ...
-
We relate three different, but equivalent, ways to characterise
behavioural equivalence for set coalgebras. These are: using final
coalgebras, using coalgebraic languages that have the Hennessy- Milner
property and using coalgebraic languages that have ``logical
congruences''. On the technical si...