Your SlideShare is downloading. ×
TOURNAMENTS - Stanford Facebook Class
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

Saving this for later?

Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime - even offline.

Text the download link to your phone

Standard text messaging rates apply

TOURNAMENTS - Stanford Facebook Class

816
views

Published on

Published in: Technology

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
816
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
15
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide
  • Transcript

    • 1. Tournaments: Making Life Easier with Facebook
    • 2. Why tournaments?
    • 3. 1. Hard to Create
    • 4.  
    • 5. 2. Difficult to share
    • 6.  
    • 7.  
    • 8.  
    • 9.  
    • 10. Help these people
    • 11.  
    • 12.  
    • 13.  
    • 14. What we missed
    • 15. Lightweight interaction
    • 16. Create for someone , not everyone
    • 17. http://apps.facebook.com/ mytournaments
    • 18.  
    • 19. Lessons Learned
      • System penalizes more complicated apps
      • Lightweight interactions: a must have
      • If seeking users, start simple and viral
      • Product management with simultaneous coding
      • Coding gets you chicks
    • 20. The Future
      • Other types of tournaments
      • API
      • Fans and Bets
      • March Madness
      • Clones
    • 21. What’s the problem?
      • Annoying to create
        • Paper, markers, rulers, straight lines…
      • Difficult to share
        • “ here’s a link – you have to register”
      • Not Dynamic
        • “ shoot, Ben dropped, I gotta redraw it”
      • Hard to communicate
        • “ I beat you at beirut!”
        • “ Who am I playing next?”
      • N^2 complexity with more users