Tree Automata Make Ordinal Theory Easy
Trembling hand perfection is NP-hard
Truth and Envy in Capacitated Allocation Games
Truth Revelation in Approximately Efficient Combinatorial Auctions
Truth-telling Reservations
Truthful Assignment without Money
Truthful Fair Division
Truthful Feedback for Sanctioning Reputation Mechanisms
Truthful Mechanisms for Agents that Value Privacy
Truthful Mechanisms for Competing Submodular Processes
Truthful Mechanisms for Proportionally Fair Allocations
Truthful Mechanisms via Greedy Iterative Packing
Truthful Mechanisms with Implicit Payment Computation
Truthfulness via Proxies
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
Two-agent Nash implementation: A new result
Two-Player Reachability-Price Games on Single-Clock Timed Automata