-
coined by E.
Anshelevich et al.
Schulz and Stier-Moses
focused on
equilibria in a
selfish routing game in
which edges have capacities.
Anshelevich et al. studied...
-
Selfish routing and the
price of anarchy. MIT Press. ISBN 0-262-18243-2. *
Anshelevich, Elliot; Dasgupta, Anirban; Kleinberg, Jon; Tardos, Éva; Wexler, Tom;...
- Engineers. 41 (10): 1234–41. doi:10.1109/jrproc.1953.274273. S2CID 51666906.
Anshelevich, V. (2002). A
Hierarchical Approach to
Computer Hex. Lehman,
Alfred (1964)...
- 1073/pnas.94.26.14418. PMC 25005. PMID 9405627.
Vologodskii AV,
Lukashin AV,
Anshelevich VV, Frank-Kamenetskii MD (March 1979). "Fluctuations in superhelical...
-
network design". Networks. 9 (1): 37–59. doi:10.1002/net.3230090104.
Anshelevich, Elliot; Dasgupta, Anirban; Tardos, Eva; Wexler, Tom (2003). "Near-optimal...
- Foundation) (international)
Magog (E. van der Werf, NL) Hex Hexy (V.
Anshelevich, US)
Queenbee (J. v. Ryswyck, CA)
Killerbee (E. Brasa, IT - - Six (G...
- large-N
limit of Yang-Mills
theory in two dimensions. He and
Michael Anshelevich showed that the
limit of the U(N) Yang-Mills
measure for the
plane is...
-
connection with free probability.
Confirming one
proposal of Singer,
Michael Anshelevich and
Sengupta showed that the large-N
limit of the Yang–Mills measure...
- hardness-of-approximation
results by
reduction from the
unique coverage problem.
Anshelevich, Kar and
Sekar study EF
pricing in
large markets. They
consider both...
