Sciweavers

4435 search results - page 109 / 887
» Algorithms, games, and the internet
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 9 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
DAGSTUHL
2007
15 years 6 days ago
Equilibrium Tracing in Bimatrix Games
Abstract. We analyze the relations of the van den Elzen-Talman algorithm, the Lemke-Howson algorithm and the global Newton method introduced by Govindan and Wilson. It is known tha...
Anne Balthasar
ACMDIS
2000
ACM
15 years 3 months ago
On the Move with a Magic Thing: Role Playing in Concept Design of Mobile Services and Devices
Designing concepts for new mobile services and devices, poses several challenges to the design. We consider user participation as a way to address part of the challenges. We show ...
Giulio Iacucci, Kari Kuutti, Mervi Ranta
AAAI
2011
13 years 10 months ago
Learning in Repeated Games with Minimal Information: The Effects of Learning Bias
Automated agents for electricity markets, social networks, and other distributed networks must repeatedly interact with other intelligent agents, often without observing associate...
Jacob W. Crandall, Asad Ahmed, Michael A. Goodrich
DATESO
2007
107views Database» more  DATESO 2007»
15 years 6 days ago
Work with Knowledge on the Internet - Local Search
Authors are looking within their research grant new original web local search algorithm respecting specifics of Czech national environment. We would like to initiate further debate...
Antonin Pavlicek, Josef Muknsnabl