| Strategic Monitor Placement Against Malicious Flows
|
2020 |
Auletta, Vincenzo |
| Multiwinner Rules with Variable Number of Winners
|
2020 |
Faliszewski, Piotr |
| Election Score Can Be Harder than Winner
|
2020 |
Fitzsimmons, Zack |
| From Public Announcements to Asynchronous Announcements
|
2020 |
Balbiani, Philippe |
| Inequity Aversion Pricing in Multi-Unit Markets
|
2020 |
Flammini, Michele |
| Parameterized Complexity of Manipulating Sequential Allocation
|
2020 |
Flammini, Michele |
| New Computational Models for the Choquet Integral
|
2020 |
Martin, Hugo |
| Extended Markov Games to Learn Multiple Tasks in Multi-Agent Reinforcement Learning
|
2020 |
Leon, Borja G. |
| Decoding the Imitation Security Game: Handling Attacker Imitative Behavior Deception
|
2020 |
Nguyen, Thanh H. |
| Enhanced Foraging in Robot Swarms Using Collective Lévy Walks
|
2020 |
Nauta, Johannes |
| Tackling Imitative Attacker Deception in Repeated Bayesian Stackelberg Security Games
|
2020 |
Nguyen, Thanh H. |
| Resilient Distributed Constraint Optimization in Physical Multi-Agent Systems
|
2020 |
Rust, Pierre |
| On the Complexity of Constructive Control Under Nearly Single-Peaked Preferences
|
2020 |
Yang, Yongjie |
| Speeding Up CDCL Inference with Duplicate Learnt Clauses
|
2020 |
Kochemazov, Stepan |
| Exploiting Incomparability in Solution Dominance: Improving General Purpose Constraint-Based Mining
|
2020 |
Kocak, Gökberk |
| Preprocessing in Incomplete MaxSAT Solving
|
2020 |
Leivo, Marcus |
| Branch Location Problems with Maximum Satisfiability
|
2020 |
Zaikin, Oleg |
| Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators
|
2020 |
Benabbou, Nawal |
| Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings
|
2020 |
Doskoc, Vanja |
| Tree Search for the Sequential Ordering Problem
|
2020 |
Libralesso, Luc |
Tag hinzufügen