The course will allow students to identify, classify and formulate common optimization problems in communications.The students learn a variety of algorithms to rigorously solve those optimization problems.
Furthermore, basic mathematical tools from game theory will be presented and applied in cooperative and non-cooperative communication systems.
Specifically, the following topics will be covered.
- Linear programming and resource allocation
- Convex optimization and power control
- Global optimizations and interference networks
- Non-cooperative games and distributed resource allocation
- Cooperative Games and transmit strategies in interference networks
- Coalition games and ad-hoc networks
Course with Credit Points: 5
Lecturer: Prof. Eduard Jorswieck
Assistant: Sepehr Rezvani, Martin Le