Changes

='''Algorithms and Theory Group'''=  

='''Algorithms and Theory Group'''=  

'''Department of Computer Science[http://www.cs.umd.edu/], University of Maryland, College Park[http://www.umd.edu/]'''.

'''[http://www.cs.umd.edu/ Department of Computer Science], [http://www.umd.edu/ University of Maryland, College Park]'''.

<br>

<br>

Welcome to the Wiki for our group!

Welcome to the Wiki for our group! You also follow us on Twitter [https://twitter.com/theorycsumd @theorycsumd ]

Theoretical Computer Science (TCS), broadly speaking, is concerned with understanding the very nature of computation:

Theoretical Computer Science (TCS), broadly speaking, is concerned with understanding the very nature of computation:

<li> '''Algorithmic Game Theory''':

<li> '''Algorithmic Game Theory''':

[http://www.cs.umd.edu/~hajiagha/ Mohammad Hajiaghayi],

[http://www.cs.umd.edu/~hajiagha/ Mohammad Hajiaghayi],

[http://www.cs.umd.edu/~srin/ Aravind Srinivasan],

[http://www.cs.umd.edu/~srin/ Aravind Srinivasan]

<br>

<br>

Mechanism Design in particular Algorithmic Game Theory, which can be viewed as "incentive-aware algorithm design", has become an increasingly important part of (theoretical) computer science in recent years. Recent results show a strong relation between computer science (esp. networking) and economics (esp. game theory), and techniques from each seem well-poised to help with key problems of the other.  Our main goal in this area is to study these connections which produce powerful mechanisms for adaptive and networked environments and several other applied areas, and improve the experience of users of the Web and the Internet. To this end, we do research in several topics such as algorithmic mechanism design; auctions (efficient, revenue-maximizing, sponsored search, etc.); congestion and potential games; cost sharing; existence, computation, and learning of equilibria; game theory in the Internet; network games; price of anarchy; selfish routing, etc.

Mechanism Design in particular Algorithmic Game Theory, which can be viewed as "incentive-aware algorithm design", has become an increasingly important part of (theoretical) computer science in recent years. Recent results show a strong relation between computer science (esp. networking) and economics (esp. game theory), and techniques from each seem well-poised to help with key problems of the other.  Our main goal in this area is to study these connections which produce powerful mechanisms for adaptive and networked environments and several other applied areas, and improve the experience of users of the Web and the Internet. To this end, we do research in several topics such as algorithmic mechanism design; auctions (efficient, revenue-maximizing, sponsored search, etc.); congestion and potential games; cost sharing; existence, computation, and learning of equilibria; game theory in the Internet; network games; price of anarchy; selfish routing, etc.

<br><br>

<br><br>

<li>'''Bioinformatics and Computational Biology''':

<li>'''Bioinformatics and Computational Biology''':

[http://www.cbcb.umd.edu/~mpop Mihai Pop]

[http://www.cbcb.umd.edu/~mpop Mihai Pop]

<br>

<br>

<br>

<br>

Strings of characters (or bits) is an elementary form for representing information. Pattern matching problems on strings have provided a fertile ground for idea-driven algorithmic research.

Strings of characters (or bits) is an elementary form for representing information. Pattern matching problems on strings have provided a fertile ground for idea-driven algorithmic research.

<br><br>

<br><br>

can be useful in computation.

can be useful in computation.

</ul>

</ul>