1 / 6

ITCS 3153 Artificial Intelligence

ITCS 3153 Artificial Intelligence. Lecture 8 Adversarial Search. Adversarial Search. Problems involving Multiple agents Competitive environments Agents have conflicting goals Also called games. Since the dawn of time?. Oldest known written fair-division problem (T. Hill, GaTech)

birch
Download Presentation

ITCS 3153 Artificial Intelligence

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ITCS 3153Artificial Intelligence Lecture 8 Adversarial Search

  2. Adversarial Search • Problems involving • Multiple agents • Competitive environments • Agents have conflicting goals • Also called games

  3. Since the dawn of time? • Oldest known written fair-division problem (T. Hill, GaTech) • A man dies owing 100, 200, and 300 zuz to each of three claimants, A, B, and C respectively • Modern bankruptcy provides shares of the estate proportional to their indiviual claims, no matter what size of the estate • A receives 1/6 • B receives 2/6 • C receives 3/6

  4. Oldest game theory problem • Written in the Talmud (2nd Century) • If the estate is only 100 zuz • Each claimant receives equal shares • If the estate is 200 zuz • A receives 50, B and C receive 75 even though their claims are not equal • Why?

  5. Unexplained until 1984 • Aumann and Maschler (Israeli Mathematicians) • Realistically, when you die, people could come out of the woodwork saying you owe them money. Some could coalesce into deceptive groups. How can we reduce the incentives (rewards) of forming such groups? • Minimize largest dissatisfaction among all possible coalitions • Truly many similar solutions to this problem • see http://www.math.gatech.edu/~hill/publications/cv.dir/madevice.pdf

  6. Game Theory • Studied by mathematicians, economists, finance • In AI we limit games to: • deterministic • turn-taking • two-player • zero-sum • perfect information

More Related