5,116 research outputs found
An analysis of feasible solutions for multi-issue negotiation involving non-linear utility functions
No full textThis paper analyzes bilateral multi-issue negotiation between self- interested agents. Specifically, we consider the case where issues are divisible, there are time constraints in the form of deadlines and discount factors, and the agents have different preferences over the issues. Given these differing preferences, it is possible to reach Pareto-optimal agreements by negotiating all the issues together using a package deal procedure (PDP). However, finding equilibrium strategies for this procedure is not always computationally easy. In particular, if the agents utility functions are nonlinear, then equi-librium strategies may be hard to compute. In order to overcome this complexity, we explore two different solutions. The first is to use the PDP for linear approximations of the given nonlinear utilities. The second solution is to use a simultaneous procedure (SP) where the issues are discussed in parallel but independently of each other. We then compare these two solutions both in terms of their computational properties (i.e., time complexity of computing an approximate equilibrium and the associated error of approximation) and their economic properties (i.e., the agents utilities and social welfare of the resulting outcome). By doing so, we show that an approximate equilibrium for the PDP and the SP can be found in polynomial time. In terms of the economic properties, although the PDP is known to generate Pareto optimal outcomes, we show that, in some cases, which we identify, the SP is better for one of the two agents and also increases the social welfare. Copyright © 2009, International Foundation for Autonomous Agents and Multiagent Systems
RDLS-SS-DWT v. 0.9
No full textThis fileset contains the implementation of RDLS-DWT and SS-DWT in JPEG 2000 (RDLS-SS-DWT v. 0.9), which was used in a research described in: R. Starosolski, “Application of reversible denoising and lifting steps to DWT in lossless JPEG 2000 for improved bitrates,” Signal Processing: Image Communication, Vol. 39, Part A, pp. 249-63, DOI: 10.1016/j.image.2015.09.013, 2015 and R. Starosolski, “Skipping selected steps of DWT computation in lossless JPEG 2000 for improved bitrates,” submitted. This software is intended for research purposes only; it is provided "as is"; author makes no warranty of any kind, either express or implied, with respect to this software. <br
Multi-issue negotiation with deadlines.
No full textThis paper studies bilateral multi-issue negotiation between self-interested autonomous agents. Now, there are a number of different procedures that can be used for this process; the three main ones being the package deal procedure in which all the issues are bundled and discussed together, the simultaneous procedure in which the issues are discussed simultaneously but independently of each other, and the sequential procedure in which the issues are discussed one after another. Since each of them yields a different outcome, a key problem is to decide which one to use in which circumstances. Specifically, we consider this question for a model in which the agents have time constraints (in the form of both deadlines and discount factors) and information uncertainty (in that the agents do not know the opponent's utility function). For this model, we consider issues that are both independent and those that are interdependent and determine equilibria for each case for each procedure. In doing so, we show that the package deal is in fact the optimal procedure for each party. We then go on to show that, although the package deal may be computationally more complex than the other two procedures, it generates Pareto optimal outcomes (unlike the other two), it has similar earliest and latest possible times of agreement to the simultaneous procedure (which is better than the sequential procedure), and that it (like the other two procedures) generates a unique outcome only under certain conditions (which we define)
Jestem Miłością i Miłosierdziem samym. Fatima a Miłosierdzie, praca zb. pod red. ks. Krzysztofa Czapli SAC i s. M. Elżbiety Siepak ZMBM, Apostolicum Wyd. Księży Pallotynów, Ząbki 2015, ss. 208.
No full textRecenzja książki: Jestem Miłością i Miłosierdziem samym. Fatima a Miłosierdzie, praca zb. pod red. ks. Krzysztofa Czapli SAC i s. M. Elżbiety Siepak ZMBM, Apostolicum Wyd. Księży Pallotynów, Ząbki 2015, ss. 208
Sequential auctions in uncertain information settings.
No full textThis paper analyzes sequential auctions for private value objects using second-price sealed-bid rules. Now, the equilibrium bids for such auctions depend on the information uncertainty of the bidders. Specifically, there are three key auction parameters that the bidders could be uncertain about: the valuations of the objects for sale, the number of objects for sale, and the number of participating bidders. We analyse the bidding behaviour for each of these three sources of uncertainty. For each setting, we first find the equilibrium bidding strategies for the individual auctions that comprise a series. Then we analyze the effect of these uncertainties on the computational and economic properties of the equilibrium solution. The former analysis is essential if we want to use software agents to bid on our behalf. The latter is essential because both the auctioneer and the bidders want to know how these uncertainties affect their profits. Thus we compare the outcomes for these settings from the perspective of the bidders (i.e., in terms of their profits), from the perspective of the auctioneer (i.e., in terms of his revenue), and from a global perspective (i.e., in terms of auction efficiency)
Sequential auctions for objects with common and private values
No full textSequential auctions are an important mechanism for buying/selling multiple objects. Existing work has studied sequential auctions for objects that are exclusively either common value or private value. However, in many real-world cases an object has both features. Also, in such cases, the common value component (which is the same for all bidders) depends on how much each bidder values the object. Moreover, an individual bidder generally does not know how much the other bidders value it. On the other hand, a bidder's private value is independent of the others' private values. Given this, we study settings that have both common and private value elements by treating each bidder's information about the common value as uncertain. We first determine equilibrium bidding strategies for each auction in a sequence using English auction rules. On the basis of this equilibrium, we analyse the efficiency of auctions. Specifically, we show that the inefficiency that arises as a result of uncertainty about the common values can be reduced if the auctioneer makes its information about the common value known to all bidders. Moreover, our analysis also shows that the inefficiency of auctions in an agent-based setting is higher than that in an all-human setting
Multi-issue negotiation under time constraints
No full textThis paper presents a new model for multi-issue negotiation under time constraints in an incomplete information setting. In this model the order in which issues are bargained over and agreements are reached is determined endogenously as part of the bargaining equilibrium. We show that the sequential implementation of the equilibrium agreement gives a better outcome than a simultaneous implementation when agents have like, as well as conflicting, time preferences. We also show that the equilibrium solution possesses the properties of uniqueness and symmetry, although it is not always Pareto-optimal
Approximate and online multi-issue negotiation.
No full textThis paper analyzes bilateral multi-issue negotiation between self interested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors. There are m > 1 issues for negotiation where each issue is viewed as a pie of size one. The issues are “indivisible” (i.e., individual issues cannot be split between the parties; each issue must be allocated in its entirety to either agent). Here different agents value different issues differently. Thus, the problem is for the agents to decide how to allocate the issues between themselves so as to maximize their individual utilities. For such negotiations, we first obtain the equilibrium strategies for the case where the issues for negotiation are known a priori to the parties. Then, we analyse their time complexity and show that finding the equilibrium offers is an NP-hard problem, even in a complete information setting. In order to overcome this computational complexity, we then present negotiation strategies that are approximately optimal but computationally efficient, and show that they form an equilibrium. We also analyze the relative error (i.e., the difference between the true optimum and the approximate). The time complexity of the approximate equilibrium strategies is O(nm=2) where n is the negotiation deadline and the relative error. Finally, we extend the analysis to online negotiation where different issues become available at different time points and the agents are uncertain about their valuations for these issues. Specifically, we show that an approximate equilibrium exists for online negotiation and show that the expected difference between the optimum and the approximate is O(pm) . These approximate strategies also have polynomial time complexity
The influence of information on negotiation equilibrium
No full textThis paper studies the influence of the agents' information states on the negotiation equilibrium. This analysis is undertaken by examining a range of negotiation scenarios in which the amount of information that agents have about their opponent's parameters is systematically varied. For each such scenario, we show that a unique equilibrium exists and we investigate how the information states of agents influence the distribution property of the equilibrium solution. Our study shows the relative impacts of the opponent's parameters on the negotiation outcome. The results obtained are useful for decision making in situations where an agent has the option of choosing whom to negotiate with, from among a set of bargainers, on the basis of its information state. Our analysis also indicates which of its opponent's parameters an agent should learn in order to maximize its utility
SS Northland Echo
No full textPhotograph - A view of the steamboat, SS Northland Echo on the Athabasca River. Athabasca, Albert
- …
