ATAL 2010 - PDF Preprint Papers

ATAL 2010 Intelligent Agents II

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ATAL-2010 Paper

click to vote

ATAL
2010
Springer

256views Intelligent Agents» more ATAL 2010»

Virtual world builder toolkit

14 years 16 days ago

Download www.iiia.csic.es

In this paper we present a system that automatically generates a 3D virtual world from a virtual institution (VI) specification, namely of activities that will take place in the v...

T. Trescak, M. Esteva, I. Rodriguez, J. Morales

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	256	Virtual world builder toolkit	claim
2	228	Eclipse-based Prometheus design tool	claim
3	224	Asynchronous algorithms for approximate distributed constraint optimization with quality bounds	claim
4	222	Dynamic generation and execution of human aware navigation plans	claim
5	215	Image based exploration for indoor environments using local features	claim
6	213	An evaluation tool for multiagent development techniques	claim
7	212	Heuristic search for identical payoff Bayesian games	claim
8	212	Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge	claim
9	210	Can we predict safety culture?	claim
10	207	TacTex09: a champion bidding agent for ad auctions	claim
11	202	THOMAS: a service-oriented framework for virtual organizations	claim
12	201	Generalized Fringe-Retrieving A*: faster moving target search on state lattices	claim
13	200	Inter-robot transfer learning for perceptual classification	claim
14	195	Adaptive expressiveness: virtual conversational agents that can align to their interaction partner	claim
15	194	Enumeration and exact design of weighted voting games	claim
16	193	Monotone cooperative games and their threshold versions	claim
17	192	Distributed coordination of mobile agent teams: the advantage of planning ahead	claim
18	190	Dora the Explorer: a motivated robot	claim
19	187	Learning multirobot joint action plans from simultaneous task execution demonstrations	claim
20	187	Coalition structure generation in multi-agent systems with mixed externalities	claim
21	187	An agent-based framework to support crime prevention	claim
22	186	Agreeing on plans through iterated disputes	claim
23	185	Changing neighbours: improving tag-based cooperation	claim
24	185	To teach or not to teach?: decision making under uncertainty in ad hoc teams	claim
25	184	Divide-and-coordinate: DCOPs by agreement	claim
26	183	UAV swarm coordination using cooperative control for establishing a wireless communications backbone	claim
27	183	Capturing and generating social behavior with the restaurant game	claim
28	182	Classification and strategical issues of argumentation games on structured argumentation frameworks	claim
29	181	Basis function construction for hierarchical reinforcement learning	claim
30	181	Convoy protection by self-organized teams of UAVs	claim
31	181	Planning against fictitious players in repeated normal form games	claim
32	181	Bushfire BLOCKS: a modular agent-based simulation	claim
33	180	Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem	claim
34	180	Automated negotiation with decommitment for dynamic resource allocation in cloud computing	claim
35	179	Aggregation-mediated collective perception and action in a group of miniature robots	claim
36	178	Symbolic model checking for agent interactions	claim
37	178	A quantified distributed constraint optimization problem	claim
38	175	Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness	claim
39	175	Using counterfactual regret minimization to create competitive multiplayer poker agents	claim
40	175	Optimal social laws	claim
41	175	ALIVE: an agent-based framework for dynamic and robust service-oriented applications	claim
42	175	Verifying agents with memory is harder than it seemed	claim
43	173	A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks	claim
44	173	Deception in networks of mobile sensing agents	claim
45	173	Hybrid transitive trust mechanisms	claim
46	173	Time constraints in mixed multi-unit combinatorial auctions	claim
47	172	The multi variable multi constrained distributed constraint optimization framework	claim
48	172	Distributed multiagent learning with a broadcast adaptive subgradient method	claim
49	172	Biologically inspired coalition formation of multi-agent systems	claim
50	171	Distributed BDD-based BMC for the verification of multi-agent systems	claim
51	171	Closing the learning-planning loop with predictive state representations	claim
52	170	Modeling recursive reasoning by humans using empirically informed interactive POMDPs	claim
53	170	Exploiting scale invariant dynamics for efficient information propagation in large teams	claim
54	170	Joint process games: from ratings to wikis	claim
55	168	Narrative generation through characters' point of view	claim
56	167	Parameterizing the winner determination problem for combinatorial auctions	claim
57	166	Intelligent agents for the smart grid	claim
58	166	Avoiding the prisoner's dilemma in auction-based negotiations for highly rugged utility spaces	claim
59	165	Alternating-time dynamic logic	claim
60	164	Scalable mechanism design for the procurement of services with uncertain durations	claim
61	164	DipGame: a testbed for multiagent systems	claim
62	164	Bayesian role discovery for multi-agent reinforcement learning	claim
63	164	On the logic of argumentation theory	claim
64	164	Point-based policy generation for decentralized POMDPs	claim
65	164	Agent-based micro-storage management for the Smart Grid	claim
66	164	A simulation approach to design contracts that govern emergent multi-agent systems	claim
67	162	A model of normative power	claim
68	162	Evaluating models of speaker head nods for virtual agents	claim
69	161	Role evolution in Open Multi-Agent Systems as an information source for trust	claim
70	161	An agent communication protocol for resolving conflicts	claim
71	161	When should there be a "Me" in "Team"?: distributed multi-agent optimization under uncertainty	claim
72	161	MAS-DisCoSim 4 PDP: a testbed for multi-agent solutions to PDPs	claim
73	160	A distributed algorithm for anytime coalition structure generation	claim
74	160	Agent interaction, multiple perspectives, and swarming simulation	claim
75	159	Modeling collision avoidance behavior for virtual humans	claim
76	159	Agents towards vehicle routing problems	claim
77	159	Coalition formation with spatial and temporal constraints	claim
78	158	Reasoning about strategies of multi-agent programs	claim
79	158	Combining manual feedback with subsequent MDP reward signals for reinforcement learning	claim
80	157	Bootstrapping trust evaluations through stereotypes	claim
81	157	Formalizing organizational constraints: a semantic approach	claim
82	157	Augmenting appearance-based localization and navigation using belief update	claim
83	157	Argumentation vs aggregation of trust evidence	claim
84	156	On the role of distances in defining voting rules	claim
85	156	Decision making with dynamically arriving information	claim
86	156	Occlusion-aware multi-UAV surveillance	claim
87	154	A logic-based representation for coalitional games with externalities	claim
88	153	Ants meeting algorithms	claim
89	153	Decision rules and decision markets	claim
90	153	Model checking detectability of attacks in multiagent systems	claim
91	153	An architecture for modular distributed simulation with agent-based models	claim
92	153	Characterising and matching iterative and recursive agent interaction protocols	claim
93	152	Laplacian-based consensus on spatial computers	claim
94	152	Rational agents: prioritized goals, goal dynamics, and agent programming languages with declarative goals	claim
95	152	Learning context conditions for BDI plan selection	claim
96	152	Agent-encapsulated Bayesian networks and the rumor problem	claim
97	151	Combinatorial auctions with externalities	claim
98	150	Identifying and utilizing subgroup coordination patterns in team adversarial games	claim
99	150	Collaborative foraging using beacons	claim
100	150	A systematic agent framework for situated autonomous systems	claim
101	149	MagneBike: toward multi climbing robots for power plant inspection	claim
102	149	Multi robotic exploration with communication requirement to a fixed base station	claim
103	149	Developing high-level cognitive functions for service robots	claim
104	149	Opportunistic belief reconciliation during distributed interactions	claim
105	148	How important are updating schemes in multi-agent systems? An illustration on a multi-turmite model	claim
106	148	False-name-proofness with bid withdrawal	claim
107	148	Local search for distributed asymmetric optimization	claim
108	147	Strategic planning for probabilistic games with incomplete information	claim
109	146	Preference elicitation for risky prospects	claim
110	146	PAC-MDP learning with knowledge-based admissible models	claim
111	146	Virtual world grammar	claim
112	146	Directing value: driven artificial characters	claim
113	145	Runtime monitoring of contract regulated web services	claim
114	144	Making norms concrete	claim
115	143	Robust Bayesian methods for Stackelberg security games	claim
116	143	Evaluating directorial control in a character-centric interactive narrative framework	claim
117	143	EMFGormas: a CASE tool for developing service-oriented open MAS	claim
118	142	Collective argument evaluation as judgement aggregation	claim
119	142	Strategy-proof allocation of multiple items between two agents without payments or priors	claim
120	142	Argumentative alternating offers	claim
121	141	Risk-sensitive planning in partially observable environments	claim
122	141	Toward an interleaved model of actions and words in social simulation	claim
123	141	How was your day?: a companion ECA	claim
124	141	Analyzing the impact of human bias on human-agent teams in resource allocation domains	claim
125	140	Complexity of judgment aggregation: safety of the agenda	claim
126	140	Game theoretic network centrality: exact formulas and efficient algorithms	claim
127	140	A game-theoretic analysis of market selection strategies for competing double auction marketplaces	claim
128	140	Decentralized hash tables for mobile robot teams solving intra-logistics tasks	claim
129	140	Pure Nash equilibria: complete characterization of hard and easy graphical games	claim
130	140	History-dependent graphical multiagent models	claim
131	139	Establishing spatially targeted communication in a heterogeneous robot swarm	claim
132	139	Multimodal interaction with a virtual character in interactive storytelling	claim
133	139	Frequency adjusted multi-agent Q-learning	claim
134	139	Deceptive agents and language	claim
135	138	Merging example plans into generalized plans for non-deterministic environments	claim
136	138	Agent based information aggregation markets	claim
137	138	Dependence theory via game theory	claim
138	138	Strategic argumentation in open multi-agent societies	claim
139	138	Robot coordination with ad-hoc team formation	claim
140	138	Efficient multi-agent coordination using resource-aware junction trees	claim
141	137	Sharing a reward based on peer evaluations	claim
142	137	Aggregating preferences in multi-issue domains by using maximum likelihood estimators	claim
143	137	Anytime dynamic programming for coalition structure generation	claim
144	137	Co-evolution of agent strategies in N-player dilemmas	claim
145	136	Quasi deterministic POMDPs and DecPOMDPs	claim
146	136	Independent navigation of multiple robots and virtual agents	claim
147	136	Finding approximate competitive equilibria: efficient and fair course allocation	claim
148	136	Using graph analysis to study networks of adaptive agent	claim
149	135	Approximate planning for decentralized MDPs with sparse interactions	claim
150	135	CTL.STIT: enhancing ATL to express important multi-agent system verification properties	claim
151	135	Coalition detection and identification	claim
152	134	Action discovery for reinforcement learning	claim
153	134	Cultivating desired behaviour: policy teaching via environment-dynamics tweaks	claim
154	133	Manipulation of copeland elections	claim
155	133	An effective personal mobile robot agent through symbiotic human-robot interaction	claim
156	133	Learning policies through argumentation-derived evidence	claim
157	133	Taking turns in general sum Markov games	claim
158	132	Evaluation of virtual agents utilizing theory of mind in a real time action game	claim
159	132	Assignment problem in requirements driven agent collaboration and its implementation	claim
160	132	Exploiting domain knowledge to improve norm synthesis	claim
161	132	Success, strategy and skill: an experimental study	claim
162	132	Agent-based analysis of asset pricing under ambiguous information	claim
163	131	Multi-agent coordination in the electricity grid, from concept towards market introduction	claim
164	131	Multi-humoroid: joking system that reacts with humor to humans' bad moods	claim
165	131	Influence of different execution models on patrolling ant behaviors: from agents to robots	claim
166	131	Adversarial planning for large multi-agent simulations	claim
167	131	On events in multi-robot patrol in adversarial environments	claim
168	131	Distributed clustering for group formation and task allocation	claim
169	130	A simulator for organisation-centred MAS adaptation in P2P sharing networks	claim
170	130	Validation of agent based crowd egress simulation	claim
171	130	Collective decision-making in multi-agent systems by implicit leadership	claim
172	130	Path disruption games	claim
173	130	High-level reinforcement learning in strategy games	claim
174	130	A logical framework for prioritized goal change	claim
175	129	Minimal retentive sets in tournaments	claim
176	129	Trading agents for the smart electricity grid	claim
177	129	When do markets with simple agents fail?	claim
178	129	Agent programming via planning programs	claim
179	129	Learning multi-agent state space representations	claim
180	129	A probabilistic model for trust and reputation	claim
181	129	Incremental plan aggregation for generating policies in MDPs	claim
182	129	Multi-agent plan adaptation using coordination patterns in team adversarial games	claim
183	129	Graphically explaining norms	claim
184	129	Online model learning in adversarial Markov decision processes	claim
185	128	Honor among thieves: collusion in multi-unit auctions	claim
186	128	Approximate dynamic programming with affine ADDs	claim
187	127	Optimal temporal decoupling in multiagent systems	claim
188	127	Resource-bounded alternating-time temporal logic	claim
189	127	A clustering approach to filtering unfair testimonies for reputation systems	claim
190	127	Programming norm change	claim
191	127	Using geometric diffusions for recognition-primed multi-agent decision making	claim
192	127	A BDI architecture for normative decision making	claim
193	126	Improving DPOP with function filtering	claim
194	126	A reward function generation method using genetic algorithms: a robot soccer case study	claim
195	126	Training a Tetris agent via interactive shaping: a demonstration of the TAMER framework	claim
196	125	A graph-theoretic approach to protect static and moving targets from adversaries	claim
197	125	Multi-robot area coverage with limited visibility	claim
198	125	Strategy exploration in empirical games	claim
199	125	On the limits of dictatorial classification	claim
200	124	A general, fully distributed multi-agent planning algorithm	claim
201	123	Infinite order Lorenz dominance for fair multiagent optimization	claim
202	123	Point-based backup for decentralized POMDPs: complexity and new algorithms	claim
203	123	Linear options	claim
204	123	Evolving policy geometry for scalable multiagent learning	claim
205	123	Coordination through institutional roles in robot collectives	claim
206	123	Mutual state capability-based role assignment model	claim
207	122	Parasocial consensus sampling: combining multiple perspectives to learn virtual human behavior	claim
208	121	Male optimality and uniqueness in stable marriage problems with partial orders	claim
209	121	On learning in agent-centered search	claim
210	120	Distributed abductive reasoning with constraints	claim
211	120	Generation and analysis of multiple futures with swarming agents	claim
212	120	Computing equilibria by incorporating qualitative models?	claim
213	120	Distributed semantic search for the web: a multiagent approach	claim
214	119	An integrated possibilistic framework for goal generation in cognitive agents	claim
215	119	Designing sponsored search auctions for federated domain-specific search engines	claim
216	119	Speeding up gradient-based algorithms for sequential games	claim
217	119	Complexity of social welfare optimization in multiagent resource allocation	claim
218	119	Flexible task resourcing for intelligent agents	claim
219	119	Logic of information flow on communication channels	claim
220	118	Combining statistics and arguments to compute trust	claim
221	118	How to protect a city: strategic security placement in graph-based domains	claim
222	117	Wishful thinking in effective decision making	claim
223	117	Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms	claim
224	117	A formal approach to MASQ	claim
225	117	Agents and artefacts for multiple models co-evolution: building complex system simulation as a set of interacting models	claim
226	117	Improving the efficiency of the distributed stochastic algorithm	claim
227	117	The RoboCup rescue simulation platform	claim
228	115	Moving target D* Lite	claim
229	115	Self-organization for coordinating decentralized reinforcement learning	claim
230	115	Strategy generation in multi-agent imperfect-information pursuit games	claim
231	115	Using stereotypes to understand one's interactive partner	claim
232	115	Using training regimens to teach expanding function approximators	claim
233	114	Multi-target adaptive A	claim
234	114	Emotions to control agent deliberation	claim
235	114	Flexibly priced options: a new mechanism for sequential auction markets with complementary goods	claim
236	114	Accommodating driver preferences in reservation-based urban traffic management	claim
237	114	AgentC: agent-based testbed for adversarial modeling and reasoning in the maritime domain	claim
238	113	Multiagent resource allocation with sharable items: simple protocols and Nash equilibria	claim
239	113	A mean-based approach for real-time planning	claim
240	113	Collaborative multiagent Gaussian inference in a dynamic environment using belief propagation	claim
241	113	A game theoretic approach to decentralized multi-project scheduling	claim
242	113	Dynamic plot generation by continual multiagent planning	claim
243	113	Self-organisation in an agent network via learning	claim
244	112	Decision-support for real-time multi-agent coordination	claim
245	112	A social-network defence against whitewashing	claim
246	112	MARIOnET: motion acquisition for robots through iterative online evaluative training	claim
247	111	On efficient mediation approach to multi-issue negotiation with optimal and fair outcomes	claim
248	111	Using spatial hints to improve policy reuse in a reinforcement learning agent	claim
249	111	Reversal of influence: decrease of innovator's influence under information diversification	claim
250	111	Coordinated navigation for multi-robot systems with additional constraints	claim
251	110	A coherence-driven action selection in dynamic environments	claim
252	110	Improving multi-robot teleoperation by inferring operator distraction	claim
253	109	A semiotic perspective for multiagent systems development	claim
254	109	ESP: pursuit evasion on series-parallel graphs	claim
255	109	A multi-issue negotiation framework for non-monotonic preference spaces	claim
256	109	Searching for a k-clique in unknown graphs	claim
257	108	Agent composition synthesis based on ATL	claim
258	108	Information sharing for distributed planning	claim
259	108	Strategic executions of choreographed timed normative multi-agent systems	claim
260	108	On agent types in coalition formation problems	claim
261	108	Coordination for uncertain outcomes using distributed neighbor exchange	claim
262	107	Using machine learning to augment collaborative filtering of community discussions	claim
263	107	Generalized solution techniques for preference-based constrained optimization with CP-nets	claim
264	107	Internal implementation	claim
265	107	Optimal policy switching algorithms for reinforcement learning	claim
266	105	Searching for pure strategy equilibria in bilateral bargaining with one-sided uncertainty	claim
267	105	Requesting agent participation in electronic institutions	claim
268	104	An algorithmic game theory framework for bilateral bargaining with uncertainty	claim
269	104	Reasoning about agents and protocols via goals and commitments	claim
270	104	Knowledge representation, communication, and update in probability-based multiagent systems	claim
271	104	On monotonic mixed tactics and strategies for multi-issue negotiation	claim
272	104	Flexible agreement mechanism for dynamic meaning negotiation	claim
273	103	A grey-box approach to automated mechanism design	claim
274	103	Knowledge in lineland	claim
275	102	Improving the performance of complex agent plans through reinforcement learning	claim
276	102	Effect of probabilistic task allocation based on statistical analysis of bid values	claim
277	102	Inductively generated trust alignments based on shared interactions	claim
278	102	An investigation of representations of combinatorial auctions	claim
279	102	Emotional eye movement markup language for virtual agents	claim
280	101	Partitioning the multiagent simple temporal problem for concurrency and privacy	claim
281	100	Incentive analysis of approximately efficient allocation algorithms	claim
282	100	Improved bounded model checking for a fair branching-time temporal epistemic logic	claim
283	100	An approach to integrate web services and argumentation into a BDI system	claim
284	97	Characterization of false-name-proof social choice mechanisms	claim
285	96	Genetic-aided multi-issue bilateral bargaining for complex utility functions	claim
286	94	Valuing search and communication in partially-observable coordination problems	claim
287	94	Multi-agent coordination and control system for multi-vehicle agricultural operations	claim
288	94	Robots autonomously self-assemble into dedicated morphologies to solve different tasks	claim
289	93	Effective negotiation with partial preference information	claim
290	93	Optimal seeding in knockout tournaments	claim
291	92	Convention emergence through spreading mechanisms	claim
292	91	On-line robot execution monitoring using probabilistic action duration	claim
293	90	Representing Bayesian games without a common prior	claim
294	90	Market-based risk allocation for multi-agent systems	claim
295	88	Syncretic argumentation by lattice homomorphism and fusion	claim
296	86	The practical advantage of surprise-based agents	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers