Sciweavers

1166 search results - page 80 / 234
» Negotiating Using Rewards
Sort
View
117
Voted
ICISS
2009
Springer
15 years 8 months ago
Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles
Many peer-assisted content-distribution systems reward a peer based on the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowled...
Michael K. Reiter, Vyas Sekar, Chad Spensky, Zheng...
ANSS
2001
IEEE
15 years 5 months ago
Simulation-Based Engineering of Complex Adaptive Systems Using a Classifier Block
A Complex Adaptive System (CAS) is a network of communicating, intelligent agents where each agent adapts its behavior in order to collaborate with other agents to achieve overall...
John R. Clymer, David J. Chen
153
Voted
IAT
2010
IEEE
15 years 4 days ago
Using a Social Orientation Model for the Evolution of Cooperative Societies
We utilize evolutionary game theory to study the evolution of cooperative societies and the behaviors of individual agents (i.e., players) in such societies. We present a novel pla...
Kan-Leung Cheng, Inon Zuckerman, Ugur Kuter, Dana ...
FLAIRS
2004
15 years 3 months ago
State Space Reduction For Hierarchical Reinforcement Learning
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
Mehran Asadi, Manfred Huber
139
Voted
IJCAI
2001
15 years 3 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz