A multicolumn B-tree stores keys in a defined order. Equality conditions on leading columns, followed by a range or ordering column, often form a useful access path. An index on tenant_id, placed_at serves a tenant's date range differently from one on placed_at, tenant_id.
INCLUDE stores extra output columns without turning them into search keys. An index-only scan is possible when the needed values are in the index and visibility information allows PostgreSQL to avoid heap fetches. A covering index doesn't guarantee zero heap work on a table that changes frequently.
Avoid adding every column to an index. Wider indexes cost more to store and update. Match a stated query first, then inspect a real plan and workload before deciding whether that tradeoff pays. These tasks check stored key order and included columns instead of demanding an unstable timing improvement.
Put the tenant equality key before the timestamp range key.