Sciweavers

1410 search results - page 144 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
102
Voted
CIMCA
2008
IEEE
15 years 6 months ago
Seller's Strategies for Predicting Winning Bid Prices in Online Auctions
Online auctions have become extremely popular in recent years. Ability to predict winning bid prices accurately can help bidders to maximize their profit. This paper proposes a nu...
Yevgeniya Kovalchuk
IJSR
2011
74views more  IJSR 2011»
14 years 6 months ago
Acting Deceptively: Providing Robots with the Capacity for Deception
Deception is utilized by a variety of intelligent systems ranging from insects to human beings. It has been argued that the use of deception is an indicator of theory of mind [2] ...
Alan R. Wagner, Ronald C. Arkin
PODC
2009
ACM
16 years 6 days ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
101
Voted
SOFSEM
2010
Springer
15 years 8 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
WINE
2009
Springer
93views Economy» more  WINE 2009»
15 years 6 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...