Sciweavers

156 search results - page 28 / 32
» Homotopy Methods to Compute Equilibria in Game Theory
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
DIMACS
1996
13 years 9 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
ATAL
2005
Springer
14 years 1 months ago
A cooperative multi-agent approach to free flight
The next generation of air traffic control will require automated decision support systems in order to meet safety, reliability, flexibility, and robustness demands in an environ...
Jared C. Hill, F. Ryan Johnson, James K. Archibald...
BIRTHDAY
2003
Springer
14 years 27 days ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Ben C. Moszkowski
GLOBECOM
2008
IEEE
14 years 2 months ago
A Low-Signalling Scheme for Distributed Resource Allocation in Multi-Cellular OFDMA Systems
—This paper considers distributed protocol design for joint sub-carrier, transmission scheduling and power management in uplink/downlink multi-cellular OFDMA wireless networks. T...
Pablo Soldati, Mikael Johansson