Back to Results
First PageMeta Content
Tree / Graph theory / Graph connectivity / Path


Solving Security Games on Graphs via Marginal Probabilities Joshua Letchford and Vincent Conitzer Duke University Department of Computer Science Durham, NC 27708, USA {jcl,conitzer}@cs.duke.edu
Add to Reading List

Document Date: 2013-04-10 13:14:59

Open Document

File Size: 264,95 KB

Share Result on Facebook

City

Beijing / Los Angeles / IRIS / /

Company

Multiagent Systems / Multi-Agent Systems / Vertex / P LP / Compact LP / /

Country

United States / /

/

Facility

Los Angeles International Airport / /

IndustryTerm

flow-based algorithm / game-theoretic solutions / marginal solution / marginal solutions / polynomial-time algorithm / e - commerce / transportation networks / realworld security applications / direct algorithm / transit systems / /

Organization

National Science Foundation / ARO / Artificial Copyright Intelligence / US Coast Guard in Boston / Association for the Advancement / Duke University Department of Computer Science Durham / /

Person

Vincent Conitzer / Dmytro Korzhyk / Path Tree / Albert Xin Jiang / Ua / Edge Yes / Ronald Parr / /

Position

guard / inspector / General / player / officer / /

Product

Budish et al. / /

PublishedMedium

Games and Economic Behavior / /

Technology

flow-based algorithm / artificial intelligence / machine translation / polynomial-time algorithm / Introduction Algorithms / direct algorithm / /

URL

www.aaai.org / /

SocialTag