Results 121 to 130 of about 7,321 (135)

Finding Colorings in One-Sided Expanders

arXiv.org
We establish new algorithmic guarantees with matching hardness results for coloring and independent set problems in one-sided expanders and related classes of graphs. For example, given a $3$-colorable regular one-sided expander, we compute in polynomial
Rares-Darius Buhai, Yiding Hua, David Steurer, Andor V'ari-Kakas   +3 more
semanticscholar   +1 more source

Bidding Models and Repeated Games with Incomplete Information: A Survey

Automation and remote control, 2019
V. Kreps
semanticscholar   +1 more source

Repeated Bidding Games with Incomplete Information and Bounded Values: On the Exponential Speed of Convergence

IGTR, 2017
Marina Sandomirskaia
semanticscholar   +1 more source

Repeated games with asymmetric information and random price fluctuations at finance markets

International Journal of Game Theory, 2007
V. Domansky
semanticscholar   +1 more source

Strong Nash Equilibrium in Multistage Games

IGTR, 2002
L. Petrosjan, L. V. Grauer
semanticscholar   +1 more source

Repeated games simulating exchange auction and recursive sequences

, 2009
V. Kreps
semanticscholar   +1 more source

Folk theorems in multicriteria repeated N-person games

, 2002
L. Petrosjan, J. Puerto
semanticscholar   +1 more source

Should I remember more than you? Best responses to factored strategies

International Journal of Game Theory, 2020
R. Levínský, A. Neyman, M. Zelený
semanticscholar   +1 more source

Games and Dynamic Games

, 2012
A. Haurie, J. Krawczyk, G. Zaccour
semanticscholar   +1 more source

On ”Games and Dynamic Games” by A. Haurie, J.B. Krawczyk and G. Zaccour

, 2013
P. Więcek
semanticscholar   +1 more source