We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Abstract. We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of pro...
When rational but myopic agents negotiate over the exchange of indivisible resources, any restriction to the negotiation protocol may prevent the system from converging to a socia...
Reactive real-time systems have to react to external events within time constraints: Triggered tasks must execute within deadlines. The goal of this article is to automate, based ...
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...