Sciweavers

5995 search results - page 238 / 1199
» Algorithmic Game Theory
Sort
View
CORR
2008
Springer
227views Education» more  CORR 2008»
15 years 5 months ago
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Bruno Codenotti, Stefano De Rossi, Marino Pagan
ICCS
2005
Springer
15 years 11 months ago
Games of Inquiry for Collaborative Concept Structuring
Google’s project to digitize five of the world's greatest libraries will dramatically extend their search engine reach in the future. Current search-engine philosophy, which...
Mary A. Keeler, Heather D. Pfeiffer
IE
2007
15 years 7 months ago
Through the looking glass: game worlds as representations and views from elsewhere
This paper describes the rationale and subsequent development stages of a work in progress: a graffiti toolkit for rich spatial 3D environments and an actual world mnemonic collec...
J. Turner, Nicola J. Bidwell
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
15 years 5 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 9 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber