Sciweavers

Share
CORR
2011
Springer
194views Education» more  CORR 2011»
8 years 5 months ago
Approachability of Convex Sets in Games with Partial Monitoring
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...
Vianney Perchet
CORR
2011
Springer
181views Education» more  CORR 2011»
8 years 5 months ago
Contract-Based Cooperative Spectrum Sharing
—Providing proper economic incentives is essential for the success of dynamic spectrum sharing. Cooperative spectrum sharing is one effective way to achieve this goal. In coopera...
Lingjie Duan, Lin Gao, Jianwei Huang
CLIMA
2009
8 years 8 months ago
Argumentation-Based Preference Modelling with Incomplete Information
Abstract. No intelligent decision support system functions even remotely without knowing the preferences of the user. A major problem is that the way average users think about and ...
Wietske Visser, Koen V. Hindriks, Catholijn M. Jon...
JUCS
2008
104views more  JUCS 2008»
8 years 10 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
EOR
2008
77views more  EOR 2008»
8 years 10 months ago
Evaluation of firm's loss due to incomplete information in real investment decision
We investigate the effect of incomplete information in a model where a start-up with a unique idea and technology pioneers a new market but will eventually be expelled from the ma...
Michi Nishihara, Masao Fukushima
AAAI
2000
8 years 11 months ago
Gridworlds as Testbeds for Planning with Incomplete Information
Gridworlds are popular testbeds for planning with incomplete information but not much is known about their properties. We study a fundamental planning problem, localization, to in...
Craig A. Tovey, Sven Koenig
UAI
2004
8 years 11 months ago
Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty
Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is n...
Nathanael Hyafil, Craig Boutilier
CLIMA
2010
8 years 11 months ago
Finding Uniform Strategies for Multi-agent Systems
We present an algorithm for finding uniform strategies in multi-agent systems with incomplete information. The algorithm finds all maximal uniform strategies for agents with incomp...
Jan Calta, Dmitry Shkatov, Bernd-Holger Schlinglof...
ATAL
2008
Springer
9 years 4 days ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
ECAI
2006
Springer
9 years 1 months ago
An Automated Agent for Bilateral Negotiation with Bounded Rational Agents with Incomplete Information
Many day-to-day tasks require negotiation, mostly under conditions of incomplete information. In particular, the opponent's exact tradeoff between different offers is usually ...
Raz Lin, Sarit Kraus, Jonathan Wilkenfeld, James B...
books