CS344M Autonomous Multiagent Systems Todd Hester Department of - - PowerPoint PPT Presentation

cs344m autonomous multiagent systems
SMART_READER_LITE
LIVE PREVIEW

CS344M Autonomous Multiagent Systems Todd Hester Department of - - PowerPoint PPT Presentation

CS344M Autonomous Multiagent Systems Todd Hester Department of Computer Science The University of Texas at Austin Good Afternoon, Colleagues Are there any questions? Todd Hester Logistics FAI talk on Friday Dr. Karthik Dantu (Fri.,


slide-1
SLIDE 1

CS344M Autonomous Multiagent Systems

Todd Hester Department of Computer Science The University of Texas at Austin

slide-2
SLIDE 2

Good Afternoon, Colleagues

Are there any questions?

Todd Hester

slide-3
SLIDE 3

Logistics

  • FAI talk on Friday

− Dr. Karthik Dantu (Fri., 11am, PAI 3.14) − Challenges in Building a Swarm of Robotic Bees

Todd Hester

slide-4
SLIDE 4

Logistics

  • FAI talk on Friday

− Dr. Karthik Dantu (Fri., 11am, PAI 3.14) − Challenges in Building a Swarm of Robotic Bees

  • Peer Reviews due Thursday

Todd Hester

slide-5
SLIDE 5

Logistics

  • FAI talk on Friday

− Dr. Karthik Dantu (Fri., 11am, PAI 3.14) − Challenges in Building a Swarm of Robotic Bees

  • Peer Reviews due Thursday
  • Final reports due in 3 weeks!

Todd Hester

slide-6
SLIDE 6

Logistics

  • FAI talk on Friday

− Dr. Karthik Dantu (Fri., 11am, PAI 3.14) − Challenges in Building a Swarm of Robotic Bees

  • Peer Reviews due Thursday
  • Final reports due in 3 weeks!
  • Final tournament: At the class exam time (Dec 17 2pm)

Todd Hester

slide-7
SLIDE 7

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

Todd Hester

slide-8
SLIDE 8

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • What’s the value of the flash?

Todd Hester

slide-9
SLIDE 9

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • What’s the value of the flash?

− Auctions are simultaneous − Auctions are independent (no combinatorial bids)

Todd Hester

slide-10
SLIDE 10

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • What’s the value of the flash?

− Auctions are simultaneous − Auctions are independent (no combinatorial bids)

  • ∈ [10, 50] — Depends on the price of the camera

Todd Hester

slide-11
SLIDE 11

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

Todd Hester

slide-12
SLIDE 12

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $80

Todd Hester

slide-13
SLIDE 13

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $80

− score(G∗ f) =

Todd Hester

slide-14
SLIDE 14

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $80

− score(G∗ f) = max{100 − 80, 10 − 0} = 20

Todd Hester

slide-15
SLIDE 15

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $80

− score(G∗ f) = max{100 − 80, 10 − 0} = 20 − score(G∗ no-f) =

Todd Hester

slide-16
SLIDE 16

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $80

− score(G∗ f) = max{100 − 80, 10 − 0} = 20 − score(G∗ no-f) = max{50 − 80, 0 − 0} = 0

Todd Hester

slide-17
SLIDE 17

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $80

− score(G∗ f) = max{100 − 80, 10 − 0} = 20 − score(G∗ no-f) = max{50 − 80, 0 − 0} = 0 − So value(flash) = 20 − 0 = $20

Todd Hester

slide-18
SLIDE 18

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $80

− score(G∗ f) = max{100 − 80, 10 − 0} = 20 − score(G∗ no-f) = max{50 − 80, 0 − 0} = 0 − So value(flash) = 20 − 0 = $20

  • Already bought camera ⇒ price = $0

Todd Hester

slide-19
SLIDE 19

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $80

− score(G∗ f) = max{100 − 80, 10 − 0} = 20 − score(G∗ no-f) = max{50 − 80, 0 − 0} = 0 − So value(flash) = 20 − 0 = $20

  • Already bought camera ⇒ price = $0⇒

value(flash) = 100 − 50 = $50

Todd Hester

slide-20
SLIDE 20

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

Todd Hester

slide-21
SLIDE 21

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $20, flash = $10

− value(flash) would be

Todd Hester

slide-22
SLIDE 22

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $20, flash = $10

− value(flash) would be 80 − 30 = $50 − value(camera) would be

Todd Hester

slide-23
SLIDE 23

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $20, flash = $10

− value(flash) would be 80 − 30 = $50 − value(camera) would be 90 − 0 = $90

  • But what if prices jump at the end?

Todd Hester

slide-24
SLIDE 24

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $20, flash = $10

− value(flash) would be 80 − 30 = $50 − value(camera) would be 90 − 0 = $90

  • But what if prices jump at the end?

− Let average past camera price = $80, flash = $30

Todd Hester

slide-25
SLIDE 25

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • Let current camera price = $20, flash = $10

− value(flash) would be 80 − 30 = $50 − value(camera) would be 90 − 0 = $90

  • But what if prices jump at the end?

− Let average past camera price = $80, flash = $30 − value(flash) = $20 − value(camera) = $70

Todd Hester

slide-26
SLIDE 26

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

Todd Hester

slide-27
SLIDE 27

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • What’s the value of the flash?

− Camera price = $70 ⇒ value(flash) = $30 − Camera price = $20 ⇒ value(flash) = $50 − Camera price = $40 ⇒ value(flash) = $50

Todd Hester

slide-28
SLIDE 28

Bidding for Multiple Items

utility camera alone $50 flash alone 10 both 100 neither

  • What’s the value of the flash?

− Camera price = $70 ⇒ value(flash) = $30 − Camera price = $20 ⇒ value(flash) = $50 − Camera price = $40 ⇒ value(flash) = $50

  • Expected value: resample camera price, take avg.

Todd Hester

slide-29
SLIDE 29

Spectrum licenses

  • Worth a lot
  • But how much to whom?

Todd Hester

slide-30
SLIDE 30

Spectrum licenses

  • Worth a lot
  • But how much to whom?
  • Used to be assigned

Todd Hester

slide-31
SLIDE 31

Spectrum licenses

  • Worth a lot
  • But how much to whom?
  • Used to be assigned

− took too long

Todd Hester

slide-32
SLIDE 32

Spectrum licenses

  • Worth a lot
  • But how much to whom?
  • Used to be assigned

− took too long

  • Switched to lotteries

Todd Hester

slide-33
SLIDE 33

Spectrum licenses

  • Worth a lot
  • But how much to whom?
  • Used to be assigned

− took too long

  • Switched to lotteries

− too random − clear that lots of value given away

Todd Hester

slide-34
SLIDE 34

Spectrum licenses

  • Worth a lot
  • But how much to whom?
  • Used to be assigned

− took too long

  • Switched to lotteries

− too random − clear that lots of value given away So decided to auction

Todd Hester

slide-35
SLIDE 35

Goals of mechanism

  • Efficient allocation (assign to whom it’s worth the most)
  • Promote deployment of new technologies
  • Prevent monopoly (or close)
  • Get some licenses to designated companies
  • No political embarrassments

Todd Hester

slide-36
SLIDE 36

Goals of mechanism

  • Efficient allocation (assign to whom it’s worth the most)
  • Promote deployment of new technologies
  • Prevent monopoly (or close)
  • Get some licenses to designated companies
  • No political embarrassments

Revenue an afterthought (but important in end)

Todd Hester

slide-37
SLIDE 37

Choices

  • Which basic auction format?

Todd Hester

slide-38
SLIDE 38

Choices

  • Which basic auction format?
  • Sequential or simultaneous auctions?

Todd Hester

slide-39
SLIDE 39

Choices

  • Which basic auction format?
  • Sequential or simultaneous auctions?
  • Combinatorial bids allowed?

Todd Hester

slide-40
SLIDE 40

Choices

  • Which basic auction format?
  • Sequential or simultaneous auctions?
  • Combinatorial bids allowed?
  • How to encourage designated companies?

Todd Hester

slide-41
SLIDE 41

Choices

  • Which basic auction format?
  • Sequential or simultaneous auctions?
  • Combinatorial bids allowed?
  • How to encourage designated companies?
  • Up front payments or royalties?

Todd Hester

slide-42
SLIDE 42

Choices

  • Which basic auction format?
  • Sequential or simultaneous auctions?
  • Combinatorial bids allowed?
  • How to encourage designated companies?
  • Up front payments or royalties?
  • Reserve prices?

Todd Hester

slide-43
SLIDE 43

Choices

  • Which basic auction format?
  • Sequential or simultaneous auctions?
  • Combinatorial bids allowed?
  • How to encourage designated companies?
  • Up front payments or royalties?
  • Reserve prices?
  • How much information public?

Todd Hester

slide-44
SLIDE 44

Problems from New Zealand and Australia

Second price, sealed bid

Todd Hester

slide-45
SLIDE 45

Problems from New Zealand and Australia

Second price, sealed bid

  • High bidder’s willingness to pay is public
  • No reserve prices
  • No penalties for default, so many meaningless high bids

Todd Hester

slide-46
SLIDE 46

Problems from New Zealand and Australia

Second price, sealed bid

  • High bidder’s willingness to pay is public
  • No reserve prices
  • No penalties for default, so many meaningless high bids

Any oversight in auction design can have harmful repercussions, as bidders can be counted on to seek ways to outfox the mechanism.

Todd Hester

slide-47
SLIDE 47

License interactions

  • Complementarities: good to be able to offer roaming

capabilities

Todd Hester

slide-48
SLIDE 48

License interactions

  • Complementarities: good to be able to offer roaming

capabilities

  • Substitutability: several licenses in the same region

Todd Hester

slide-49
SLIDE 49

License interactions

  • Complementarities: good to be able to offer roaming

capabilities

  • Substitutability: several licenses in the same region
  • Need

to be flexible to allow bidders to create aggregations

Todd Hester

slide-50
SLIDE 50

License interactions

  • Complementarities: good to be able to offer roaming

capabilities

  • Substitutability: several licenses in the same region
  • Need

to be flexible to allow bidders to create aggregations

  • Secondary market might allow for some corrections

− Likely to be thin − High transaction costs

Todd Hester

slide-51
SLIDE 51

Limits of Theory

Todd Hester

slide-52
SLIDE 52

Limits of Theory

  • Identify variables, but not relative magnitudes

Todd Hester

slide-53
SLIDE 53

Limits of Theory

  • Identify variables, but not relative magnitudes

− When there are conflicting effects, can’t tell which will dominate

Todd Hester

slide-54
SLIDE 54

Limits of Theory

  • Identify variables, but not relative magnitudes

− When there are conflicting effects, can’t tell which will dominate

  • Ignores transaction costs of implementing policies

Todd Hester

slide-55
SLIDE 55

Limits of Theory

  • Identify variables, but not relative magnitudes

− When there are conflicting effects, can’t tell which will dominate

  • Ignores transaction costs of implementing policies
  • May depend on unknown information

− e.g. bidder valuations

Todd Hester

slide-56
SLIDE 56

Limits of Theory

  • Identify variables, but not relative magnitudes

− When there are conflicting effects, can’t tell which will dominate

  • Ignores transaction costs of implementing policies
  • May depend on unknown information

− e.g. bidder valuations

  • Doesn’t scale to complexity of spectrum auctions

Todd Hester

slide-57
SLIDE 57

Limits of Theory

  • Identify variables, but not relative magnitudes

− When there are conflicting effects, can’t tell which will dominate

  • Ignores transaction costs of implementing policies
  • May depend on unknown information

− e.g. bidder valuations

  • Doesn’t scale to complexity of spectrum auctions

Used laboratory experiments too

Todd Hester

slide-58
SLIDE 58

Open vs. Sealed Bid

  • Open increases information, reducing winner’s curse

Todd Hester

slide-59
SLIDE 59

Open vs. Sealed Bid

  • Open increases information, reducing winner’s curse

− Leads to higher bids

Todd Hester

slide-60
SLIDE 60

Open vs. Sealed Bid

  • Open increases information, reducing winner’s curse

− Leads to higher bids

  • But. . .

− Risk aversion leads to higher bids in sealed bid auctions − Sealed bid auctions deter colusion

Todd Hester

slide-61
SLIDE 61

Open vs. Sealed Bid

  • Open increases information, reducing winner’s curse

− Leads to higher bids

  • But. . .

− Risk aversion leads to higher bids in sealed bid auctions − Sealed bid auctions deter colusion

  • Decided former outweighed latter
  • Went with announcing bids, but not the bidders

Todd Hester

slide-62
SLIDE 62

Open vs. Sealed Bid

  • Open increases information, reducing winner’s curse

− Leads to higher bids

  • But. . .

− Risk aversion leads to higher bids in sealed bid auctions − Sealed bid auctions deter colusion

  • Decided former outweighed latter
  • Went with announcing bids, but not the bidders

− Circumvented!

Todd Hester

slide-63
SLIDE 63

Simultaneous vs. Sequential

  • Sequential prevents backup strategies for aggregation
  • Sequential also allows for budget stretching

Todd Hester

slide-64
SLIDE 64

Simultaneous vs. Sequential

  • Sequential prevents backup strategies for aggregation
  • Sequential also allows for budget stretching
  • Simultaneous needs a stopping rule

− Closing one by one is effectively sequential − Keeping all open until all close encourages sniping

Todd Hester

slide-65
SLIDE 65

Simultaneous vs. Sequential

  • Sequential prevents backup strategies for aggregation
  • Sequential also allows for budget stretching
  • Simultaneous needs a stopping rule

− Closing one by one is effectively sequential − Keeping all open until all close encourages sniping

  • Stopping rule should:

− End auction quickly − Close licenses almost simultaneously − be simple and understandable

Todd Hester

slide-66
SLIDE 66

Simultaneous vs. Sequential

  • Sequential prevents backup strategies for aggregation
  • Sequential also allows for budget stretching
  • Simultaneous needs a stopping rule

− Closing one by one is effectively sequential − Keeping all open until all close encourages sniping

  • Stopping rule should:

− End auction quickly − Close licenses almost simultaneously − be simple and understandable Went with activity rules

Todd Hester

slide-67
SLIDE 67

Combinatorial Bids

  • Nationwide

bidding could decrease efficiency and revenue

Todd Hester

slide-68
SLIDE 68

Combinatorial Bids

  • Nationwide

bidding could decrease efficiency and revenue

  • Full combinatorial bidding too complex

− Winner determination problem − Active research area

Todd Hester

slide-69
SLIDE 69

Aiding Designated Bidders

  • Give them a discount

Todd Hester

slide-70
SLIDE 70

Aiding Designated Bidders

  • Give them a discount
  • Circumvented!

Todd Hester

slide-71
SLIDE 71

Royalties vs. Up-front Payments

  • Royalties decrease risk, increase bids

Todd Hester

slide-72
SLIDE 72

Royalties vs. Up-front Payments

  • Royalties decrease risk, increase bids
  • But royalties discourage post-auction innovation

Todd Hester

slide-73
SLIDE 73

Royalties vs. Up-front Payments

  • Royalties decrease risk, increase bids
  • But royalties discourage post-auction innovation
  • Decided against

Todd Hester

slide-74
SLIDE 74

Reserve Prices

  • Not necessary in such a competitive market
  • Did include withdrawal penalties

Todd Hester

slide-75
SLIDE 75

Results

  • Big successes

− Lots of bidders − Lots of revenue

Todd Hester

slide-76
SLIDE 76

Results

  • Big successes

− Lots of bidders − Lots of revenue

  • Also some problems

− Strategic Demand Reduction

Todd Hester

slide-77
SLIDE 77

Results

  • Big successes

− Lots of bidders − Lots of revenue

  • Also some problems

− Strategic Demand Reduction

  • Incremental design changes

− New problems always arise − Bidders indeed find ways to circumvent mechanisms

Todd Hester

slide-78
SLIDE 78

Results

  • Big successes

− Lots of bidders − Lots of revenue

  • Also some problems

− Strategic Demand Reduction

  • Incremental design changes

− New problems always arise − Bidders indeed find ways to circumvent mechanisms

  • Lessons to be learned via agent-based experiments

Todd Hester

slide-79
SLIDE 79

Discussion

  • How could you fix the aspects that were circumvented?

Todd Hester

slide-80
SLIDE 80

Discussion

  • How could you fix the aspects that were circumvented?
  • Could you design a better auction mechanism?

Todd Hester

slide-81
SLIDE 81

Discussion

  • How could you fix the aspects that were circumvented?
  • Could you design a better auction mechanism?
  • Best bidding strategies?

Todd Hester

slide-82
SLIDE 82

Discussion

  • How could you fix the aspects that were circumvented?
  • Could you design a better auction mechanism?
  • Best bidding strategies?
  • Use of agents in FCC spectrum auction?

Todd Hester

slide-83
SLIDE 83

Discussion

  • How could you fix the aspects that were circumvented?
  • Could you design a better auction mechanism?
  • Best bidding strategies?
  • Use of agents in FCC spectrum auction?
  • Need to know entire agent preference...

Todd Hester

slide-84
SLIDE 84

Discussion

  • How could you fix the aspects that were circumvented?
  • Could you design a better auction mechanism?
  • Best bidding strategies?
  • Use of agents in FCC spectrum auction?
  • Need to know entire agent preference...
  • Multiple item bidding in RoboCup?

Todd Hester

slide-85
SLIDE 85

Discussion

  • How could you fix the aspects that were circumvented?
  • Could you design a better auction mechanism?
  • Best bidding strategies?
  • Use of agents in FCC spectrum auction?
  • Need to know entire agent preference...
  • Multiple item bidding in RoboCup?

Todd Hester

slide-86
SLIDE 86

Trading Agent Competition

  • Put forth as a benchmark problem for e-marketplaces

[Wellman, Wurman, et al., 2000]

  • Autonomous agents act as travel agents

Todd Hester

slide-87
SLIDE 87

Trading Agent Competition

  • Put forth as a benchmark problem for e-marketplaces

[Wellman, Wurman, et al., 2000]

  • Autonomous agents act as travel agents

− Game: 8 agents, 12 min. − Agent: simulated travel agent with 8 clients − Client: TACtown ↔ Tampa within 5-day period

Todd Hester

slide-88
SLIDE 88

Trading Agent Competition

  • Put forth as a benchmark problem for e-marketplaces

[Wellman, Wurman, et al., 2000]

  • Autonomous agents act as travel agents

− Game: 8 agents, 12 min. − Agent: simulated travel agent with 8 clients − Client: TACtown ↔ Tampa within 5-day period

  • Auctions for flights, hotels, entertainment tickets

− Server maintains markets, sends prices to agents − Agent sends bids to server over network

Todd Hester

slide-89
SLIDE 89

FCC Spectrum Auction Num. 35

  • 422 licences in 195 markets (cities)

− 80 bidders spent $8 billion − ran Dec 12 - Jan 26 2001 − licence is a 10 or 15 mhz spectrum chunk

  • Run in rounds

− bid on each licence you want each round − simultaneous; break ties by arrival time − current winner and all bids are known

  • Allowable bids: 1 to 9 bid increments

− 1 bid incr is 10% – 20% of current price

  • Other complex rules

Todd Hester