In this paper, we combine answer set programming with voting theory for the first time. For this, we use the voting procedures defined in [5], which allow winner determination under incomplete preference relations. We present the problem of scheduling a meeting for a research group as an application. In those scheduling problems, often no meetings are schedulable because of conflicting unavaila...

We investigate two systems of fully proportional representation suggested by Chamberlin & Courant and Monroe. Both systems assign a representative to each voter so that the “sum of misrepresentations” is minimized. The winner determination problem for both systems is known to be NP-hard, hence this work aims at investigating whether there are variants of the proposed rules and/or specific elect...

The theory of procurement auctions traditionally assumes that the offered quantity and quality is fixed prior to source selection. Multi-attribute reverse auctions allow negotiation over price and qualitative attributes such as color, weight, or delivery time. They promise higher market efficiency through a more effective information exchange of buyer s preferences and supplier s offerings. Thi...

Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buyers when trying to determine the best set of providersrsquo offers. Typically, a buyerrsquos decision involves a large variety of constraints that may involve attributes of a very same item as well as attributes of different, multiple items. In this paper we present the winne...

Event detection and event localization are inherent tasks of many wireless sensor network applications. The inaccuracy of sensor measurements on the one hand and resource limitations on the other make efficient event localization a challenging problem. In this paper we propose a fully distributed localization scheme that consists of two algorithms. The distributed election-winner notification a...

Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items, i.e., the Winner Determination Problem (WDP), is NP-hard. In this paper we consider the time constrained variant of this problem, that is the Bid Evaluation Problem (BEP) where temporal windows and precedence constraints are ...

Reachability games are a useful formalism for the synthesis of reactive systems. Solving a reachability game involves (1) determining the winning player and (2) computing a winning strategy that determines the winning player’s action in each state of the game. Recently, a new family of game solvers has been proposed, which rely on counterexample-guided search to compute winning sequences of act...