GotAI.NET HotLog

Форум: Проблемы искусственного интеллекта

 

Регистрация | Вход

 Все темы | Новая тема Стр.6 (39)<< < Пред. | След. > >>   Поиск:  
 Автор Тема: На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:44
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=051=> 0251p A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics,
Iyad Rahwan, Kate Larson, Fernando Tohmé, http://ijcai.org/papers09/Abstracts/051.html

Recently, Argumentation Mechanism Design (ArgMD) was introduced as a new paradigm for studying argumentation among self-interested agents using game-theoretic techniques. Preliminary results showed a condition under which a direct mechanism based on Dung's grounded semantics is strategy-proof (i.e. truth enforcing). But these early results dealt with a highly restricted form of agent preferences, and assumed agents can only hide, but not lie about, arguments. In this paper, we characterise strategy-proofness under grounded semantics for a more realistic preference class (namely, focal arguments). We also provide the first analysis of the case where agents can lie. text: http://ijcai.org/papers09/Papers/IJCAI09-051.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:44
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=052=> 0257p Coalition Structure Generation
in Multi-Agent Systems With Positive & Negative Externalities
,
Talal Rahwan, Tomasz Michalak, Nicholas Jennings, Michael Wooldridge, Peter McBurney,
http://ijcai.org/papers09/Abstracts/052.html

Coalition structure generation has received considerable attention in recent research. Several algorithms have been proposed to solve this problem in Characteristic Function Games (CFGs), where every coalition is assumed to perform equally well in any coalition structure containing it. In contrast, very little attention has been given to the more general Partition Function Games (PFGs), where a coalition's effectiveness may change from one coalition structure to another. In this paper, we deal with PFGs with positive and negative externalities. In this context, we identify the minimum search that is required in order to establish a bound on the quality of the best coalition structure found. We then develop an anytime algorithm that improves this bound with further search, and show that it outperforms the existing state-of-the-art algorithms by orders of magnitude. text: http://ijcai.org/papers09/Papers/IJCAI09-052.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:44
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=053=> 0264p Modeling Agents through Bounded Rationality Theories,
Avi Rosenfeld, Sarit Kraus, http://ijcai.org/papers09/Abstracts/053.html

Effectively modeling an agent's cognitive model is an important problem in many domains. In this paper, we explore the agents people wrote to operate within optimization problems. We claim that the overwhelming majority of these agents used strategies based on bounded rationality, even when optimal solutions could have been implemented. Particularly, we believe that many elements from Aspiration Adaptation Theory (AAT) are useful in quantifying these strategies. To support these claims, we present extensive empirical results from over a hundred agents programmed to perform in optimization problems involving solving for one and two variables. text: http://ijcai.org/papers09/Papers/IJCAI09-053.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:44
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=054=> 0272p Towards Con-Resistant Trust Models for Distributed Agent Systems,
Amirali Salehi-Abari, Tony White, http://ijcai.org/papers09/Abstracts/054.html

Artificial societies — distributed systems of autonomous agents — are becoming increasingly important in e-commerce. Agents base their decisions on trust and reputation in ways analogous to human societies. Many different definitions for trust and reputation have been proposed that incorporate many sources of information; however, system designs have tended to focus much of their attention on direct interactions. Furthermore, trust updating schemes for direct interactions have tended to uncouple updates for positive and negative feedback. Consequently, behaviour in which cycles of positive feedback followed by a single negative feedback results in untrustworthy agents remaining undetected. This con-man style of behaviour is formally described and desirable characteristics of con-resistant trust schemes proposed. A con-resistant scheme is proposed and compared with FIRE, Regret and Yu and Singh's model. Simulation experiments demonstrate the utility of the con-resistant scheme. text: http://ijcai.org/papers09/Papers/IJCAI09-054.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:45
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=055=> 0278p Probabilistic State Translation in Extensive Games with Large Action Sets,
David Schnizlein, Michael Bowling, Duane Szafron, http://ijcai.org/papers09/Abstracts/055.html

Equilibrium or near-equilibrium solutions to very large extensive form games are often computed by using abstractions to reduce the game size. A common abstraction technique for games with a large number of available actions is to restrict the number of legal actions in every state. This method has been used to discover equilibrium solutions for the game of no-limit heads-up Texas Hold'em. When using a solution to an abstracted game to play one side in the un-abstracted (real) game, the real opponent actions may not correspond to actions in the abstracted game. The most popular method for handling this situation is to translate opponent actions in the real game to the closest legal actions in the abstracted game. We show that this approach can result in a very exploitable player and propose an alternative solution. We use probabilistic mapping to translate a real action into a probability distribution over actions, whose weights are determined by a similarity metric. We show that this approach significantly reduces the exploitability when using an abstract solution in the real game. text: http://ijcai.org/papers09/Papers/IJCAI09-055.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:45
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=056=> 0285p Investigations of Continual Computation,
Dafna Shahaf, Eric Horvitz, http://ijcai.org/papers09/Abstracts/056.html

Autonomous agents that sense, reason, and act in real-world environments for extended periods often need to solve streams of incoming problems. Traditionally, effort is applied only to problems that have already arrived and have been noted. We examine continual computation methods that allow agents to ideally allocate time to solving current as well as potential future problems under uncertainty. We first review prior work on continual computation. Then, we present new directions and results, including the consideration of shared subtasks and multiple tasks. We present results on the computational complexity of the continual-computation problem and provide approximations for arbitrary models of computational performance. Finally, we review special formulations for addressing uncertainty about the best algorithm to apply, learning about performance, and considering costs associated with delayed use of results.
text: http://ijcai.org/papers09/Papers/IJCAI09-056.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:45
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=057=> 0292p Flexible Procurement of Services with Uncertain Durations using Redundancy,
Sebastian Stein, E.Gerding, A.Rogers, Kate Larson, NR Jennings, http://ijcai.org/papers09/Abstracts/057.html

Emerging service-oriented technologies allow software agents to automatically procure distributed services to complete complex tasks. However, in many application scenarios, service providers demand financial remuneration, execution times are uncertain and consumers have deadlines for their tasks. In this paper, we address these issues by developing a novel approach that dynamically procures multiple, redundant services over time, in order to ensure success by the deadline. Specifically, we first present an algorithm for finding optimal procurement solutions, as well as a heuristic algorithm that achieves over 99% of the optimal and is capable of handling thousands of providers. Using experiments, we show that these algorithms achieve an improvement of up to 130% over current strategies that procure only single services. Finally, we consider settings where service costs are not known to the consumer, and introduce several mechanisms that incentivise providers to reveal their costs truthfully and that still achieve up to 95% efficiency.
text: http://ijcai.org/papers09/Papers/IJCAI09-057.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:45
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=058=> 0299p Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm,
Ruben Stranders, Alessandro Farinelli, Alex Rogers, NR Jennings, http://ijcai.org/papers09/Abstracts/058.html

In this paper, we introduce an on-line, decentralised coordination algorithm for monitoring and predicting the state of spatial phenomena by a team of mobile sensors. These sensors have their application domain in disaster response, where strict time constraints prohibit path planning in advance. The algorithm enables sensors to coordinate their movements with their direct neighbours to maximise the collective information gain, while predicting measurements at unobserved locations using a Gaussian process. It builds upon the max-sum message passing algorithm for decentralised coordination, for which we present two new generic pruning techniques that result in speed-up of up to 92% for 5 sensors. We empirically evaluate our algorithmagainst several on-line adaptive coordination mechanisms, and report a reduction in root mean squared error up to 50% compared to a greedy strategy. text: http://ijcai.org/papers09/Papers/IJCAI09-058.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:45
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=059=> 0305p Dynamic Configuration of Agent Organizations,
Evan A. Sultanik, RN Lass, William C. Regli, http://ijcai.org/papers09/Abstracts/059.html

It is useful to impose organizational structure over multiagent coalitions. Hierarchies, for instance, allow for compartmentalization of tasks: if organized correctly, tasks in disjoint subtrees of the hierarchy may be performed in parallel. Given a notion of the way in which a group of agents need to interact, the Dynamic Distributed Multiagent Hierarchy Generation (DynDisMHG) problem is to determine the best hierarchy that might expedite the process of coordination. This paper introduces a distributed algorithm, called Mobed, for both constructing and maintaining organizational agent hierarchies, enabling exploitation of parallelism in distributed problem solving. The algorithm is proved correct and it is shown that individual additions of agents to the hierarchy will run in an amortized linear number of rounds. The hierarchies resulting after perturbations to the agent coalition have constant-bounded edit distance, making Mobed very well suited to highly dynamic problems. text: http://ijcai.org/papers09/Papers/IJCAI09-059.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:46
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=060=> 0312p Discovering Theorems in Game Theory:
Two-Person Games with Unique Pure Nash Equilibrium Payoffs
,
Pingzhong Tang, Fangzhen Lin, http://ijcai.org/papers09/Abstracts/060.html

In this paper we provide a logical framework for using computers to discover theorems in two-person finite games in strategic form, and apply it to discover classes of games that have unique pure Nash equilibrium payoffs. We consider all possible classes of games that can be expressed by a conjunction of two binary clauses, and our program re-discovered Kats and Thisse's class of weakly unilaterally competitive two-person games, and came up with several other classes of games that have unique pure Nash equilibrium payoffs. It also came up with new classes of strict games that have unique pure Nash equilibria, where a game is strict if for both player different profiles have different payoffs. text: http://ijcai.org/papers09/Papers/IJCAI09-060.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:46
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=061=> 0318p Acquiring Agent-Based Models of Conflict from Event Data,
Glenn Taylor, Michael Quist, Allen Hicken, http://ijcai.org/papers09/Abstracts/061.html

Building and using agent-based models is often impractical, in part due to the cost of including expensive subject matter experts (SMEs) in the development process. In this paper, we describe a method for "bootstrapping" model building to lower the cost of overall model development. The models we are interested in here capture dynamic phenomena related to international and subnational conflict. The method of acquiring these models begins with event data drawn from news reports about a conflict region, and infers model characteristics particular to a conflict modeling framework called the Power Structure Toolkit (PSTK). We describe the toolkit and how it has been used prior to this work. We then describe the current problem of modeling conflict and the empirical data available to learn models, and extensions to the PSTK for model generation from this data. We also describe a formative evaluation of the system that compares the performance and costs of models built entirely by an SME against models built with an SME aided by the automated model generation process. Early results indicate at least equivalent prediction rates with significant savings in model generation costs. text: http://ijcai.org/papers09/Papers/IJCAI09-061.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:46
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=062=> 0324p Where Are the Really Hard Manipulation Problems?
The Phase Transition in Manipulating the Veto Rule
,
Toby Walsh, http://ijcai.org/papers09/Abstracts/062.html

Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case since manipulation is often easy in practice. In this paper, we show that empirical studies are useful in improving our understanding of this issue. We demonstrate that there is a smooth transition in the probability that a coalition can elect a desired candidate using the veto rule as the size of the manipulating coalition increases. We show that a rescaled probability curve displays a simple and universal form independent of the size of the problem. We argue that manipulation of the veto rule is asymptotically easy for many independent and identically distributed votes even when the coalition of manipulators is critical in size. Based on this argument, we identify a situation in which manipulation is computationally hard. This is when votes are highly correlated and the election is "hung." We show, however, that even a single uncorrelated voter is enough to make manipulation easy again.
text: http://ijcai.org/papers09/Papers/IJCAI09-062.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:46
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=063=> 0330p Eliciting Honest Reputation Feedback in a Markov Setting,
Jens Witkowski, http://ijcai.org/papers09/Abstracts/063.html

Recently, online reputation mechanisms have been proposed that reward agents for honest feedback about products and services with fixed quality. Many real-world settings, however, are inherently dynamic. As an example, consider a web service that wishes to publish the expected download speed of a file mirrored on different server sites. In contrast to the models of Miller, Resnick and Zeckhauser and of Jurca and Faltings, the quality of the service (e. g., a server’s available bandwidth) changes over time and future agents are solely interested in the present quality levels. We show that hidden Markov models (HMM) provide natural generalizations of these static models and design a payment scheme that elicits honest reports from the agents after they have experienced the quality of the service.
text: http://ijcai.org/papers09/Papers/IJCAI09-063.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:47
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=064=> 0336p Finite Local Consistency Characterizes Generalized Scoring Rules,
Lirong Xia, Vincent Conitzer, http://ijcai.org/papers09/Abstracts/064.html

An important problem in computational social choice concerns whether it is possible to prevent manipulation of voting rules by making it computationally intractable. To answer this, a key question is how frequently voting rules are manipulable. We [Xia and Conitzer, 2008] recently defined the class of generalized scoring rules (GSRs) and characterized the frequency of manipulability for such rules. We showed, by examples, that most common rules seem to fall into this class. However, no natural axiomatic characterization of the class was given, leaving the possibility that there are natural rules to which these results do not apply. In this paper, we characterize the class of GSRs based on two natural properties: it is equal to the class of rules that are anonymous and finitely locally consistent.Generalized scoring rules also have other uses in computational social choice. For these uses, the order of the GSR (the dimension of its score vector) is important. Our characterization result implies that the order of a GSR is related to the minimum number of locally consistent components of the rule. We proceed to bound the minimum number of locally consistent components for some common rules. text: http://ijcai.org/papers09/Papers/IJCAI09-064.pdf
[Ответ][Цитата]
Capt.Drew
Сообщений: 4179
На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Добавлено: 21 авг 09 6:47
PART-1: AGENT-BASED and MULTI-AGENT SYSTEMS:
=065=> 0342p A Dichotomy Theorem
on the Existence of Efficient or Neutral Sequential Voting Correspondences
,
Lirong Xia, Jerome Lang, http://ijcai.org/papers09/Abstracts/065.html

Sequential voting rules and correspondences provide a way for agents to make group decisions when the set of available options has a multi-issue structure. One important question about sequential voting rules (correspondences) is whether they satisfy two crucial criteria, namely neutrality and efficiency. Recently, Benoit and Kornhauser established an important result about seat-by-seat voting rules (which are a special case of sequential voting rules): they proved that if the multi-issue domain satisfies some properties, then the only seat-by-seat rules being either efficient or neutral are dictatorships. However, there are still some cases not covered by their results, including a very important and interesting case—voting correspondences. In this paper, we extend the impossibility theorems by Benoit and Kornhauser to voting correspondences, and obtain a dichotomy theoremon the existence of efficient or neutral sequential (seat-by-seat) voting rules and correspondences. Therefore, the question of whether sequential (seat-by-seat) voting rules (correspondences) can be efficient or neutral is now completely answered. text: http://ijcai.org/papers09/Papers/IJCAI09-065.pdf
[Ответ][Цитата]
 Стр.6 (39)1  2  3  4  5  [6]  7  8  9  10  ...  39<< < Пред. | След. > >>