Displaying similar documents to “Solidarity and cooperative bargaining solutions”

Auctions with Untrustworthy Bidders

Braynov, Sviatoslav, Pavlov, Radoslav (2007)

Serdica Journal of Computing

Similarity:

The paper analyzes auctions which are not completely enforceable. In such auctions, economic agents may fail to carry out their obligations, and parties involved cannot rely on external enforcement or control mechanisms for backing up a transaction. We propose two mechanisms that make bidders directly or indirectly reveal their trustworthiness. The first mechanism is based on discriminating bidding schedules that separate trustworthy from untrustworthy bidders. The second mechanism...

Design of a Participatory Decision Making Agent Architecture Based on Argumentation and Influence Function – Application to a Serious Game about Biodiversity Conservation

Alessandro Sordoni, Jean-Pierre Briot, Isabelle Alvarez, Eurico Vasconcelos, Marta de Azevedo Irving, Gustavo Melo (2010)

RAIRO - Operations Research

Similarity:

This paper addresses an ongoing experience in the design of an artificial agent taking decisions and combining them with the decisions taken by human agents. The context is a serious game research project, aimed at computer-based support for participatory management of protected areas (and more specifically national parks) in order to promote biodiversity conservation and social inclusion. Its objective is to help various stakeholders (, environmentalist, tourism operator) to collectively...

Regles positionnelles iteratives, principe majoritaire et preferences unimodales

Dominique Lepelley, Laurent Vidu (2010)

RAIRO - Operations Research

Similarity:

Sequential scoring rules are multi-stage social choice tules that work as follows: at each stage of the process, a score is computed for each alternative by taking into account its position in the individual preference rankings, and the alternative with the lowest score is eliminated. The current paper studies the ability of these rules for choosing the Condorcet winner (or the strong Condorcet winner) when individual preferences are single-peaked.

A belief revision approach for argumentation-based negotiation agents

Pablo Pilotti, Ana Casali, Carlos Chesñevar (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

Negotiation is an interaction that happens in multi-agent systems when agents have conflicting objectives and must look for an acceptable agreement. A typical negotiating situation involves two agents that cannot reach their goals by themselves because they do not have some resources they need or they do not know how to use them to reach their goals. Therefore, they must start a negotiation dialogue, taking also into account that they might have incomplete or wrong beliefs about the...

Arbitrage for simple strategies

Agnieszka Rygiel, Łukasz Stettner (2012)

Applicationes Mathematicae

Similarity:

Various aspects of arbitrage on finite horizon continuous time markets using simple strategies consisting of a finite number of transactions are studied. Special attention is devoted to transactions without shortselling, in which we are not allowed to borrow assets. The markets without or with proportional transaction costs are considered. Necessary and sufficient conditions for absence of arbitrage are shown.

Decentralized job scheduling in the cloud based on a spatially generalized Prisoner's Dilemma game

Jakub Gąsior, Franciszek Seredyński (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

We present in this paper a novel distributed solution to a security-aware job scheduling problem in cloud computing infrastructures. We assume that the assignment of the available resources is governed exclusively by the specialized brokers assigned to individual users submitting their jobs to the system. The goal of this scheme is allocating a limited quantity of resources to a specific number of jobs minimizing their execution failure probability and total completion time. Our approach...

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

Joanna Kołodziej, Fatos Xhafa (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies,...