Sciweavers

228 search results - page 24 / 46
» Expected Reachability-Time Games
Sort
View
AAAI
1996
13 years 10 months ago
Learning Models of Intelligent Agents
Agents that operate in a multi-agent system need an efficient strategy to handle their encounters with other agents involved. Searching for an optimal interactive strategy is a ha...
David Carmel, Shaul Markovitch
JUCS
2008
104views more  JUCS 2008»
13 years 8 months ago
Optimal Transit Price Negotiation: The Distributed Learning Perspective
: We present a distributed learning algorithm for optimizing transit prices in the inter-domain routing framework. We present a combined game theoretical and distributed algorithmi...
Dominique Barth, Loubna Echabbi, Chahinez Hamlaoui
HICSS
2007
IEEE
85views Biometrics» more  HICSS 2007»
14 years 3 months ago
The Impact of Value on Governance Decisions for IT-Based Alliances: Evidence from a Joint Venture in the Wireless Networks Indus
Consideration of cost and resource benefits generated from an alliance have prevailed the theoretical and empirical research about strategic alliances and value networks/ webs. As...
Adamantia G. Pateli, George M. Giaglis
ATAL
2009
Springer
14 years 3 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...
WINE
2005
Springer
107views Economy» more  WINE 2005»
14 years 2 months ago
Price of Anarchy of Network Routing Games with Incomplete Information
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
Dinesh Garg, Yadati Narahari