Sciweavers

1410 search results - page 44 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View

Lab
652views
16 years 10 months ago
Electronic Enterprises Laboratory
Our research is motivated by a strong conviction that business processes in electronic enterprises can be designed to deliver high levels of performance through the use of mathemat...
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
15 years 11 months ago
Parallel repetition: simplifications and the no-signaling case
: Consider a game where a referee chooses (x,y) according to a publicly known distribution, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds wi...
Thomas Holenstein
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
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
AAAI
2011
13 years 11 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