Sciweavers

4435 search results - page 100 / 887
» Algorithms, games, and the internet
Sort
View
WAOA
2007
Springer
132views Algorithms» more  WAOA 2007»
16 years 28 days ago
Buyer-Supplier Games: Optimization over the Core
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
Nedialko B. Dimitrov, C. Greg Plaxton
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
15 years 8 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
15 years 5 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...
IMC
2007
ACM
15 years 8 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
GECCO
2003
Springer
133views Optimization» more  GECCO 2003»
16 years 1 days ago
Dynamic Strategies in a Real-Time Strategy Game
Abstract. Most modern real-time strategy computer games have a sophisticated but fixed ‘AI’ component that controls the computer’s actions. Once the user has learned how suc...
William Joseph Falke II, Peter Ross