Pages that link to "Item:Q257381"
From MaRDI portal
The following pages link to Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division (Q257381):
Displaying 15 items.
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Political dynamics affected by turncoats (Q682597) (← links)
- Computational social choice: the first ten years and beyond (Q2075762) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- Controlling weighted voting games by deleting or adding players with or without changing the quota (Q2169970) (← links)
- Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Cake-cutting with different entitlements: how many cuts are needed? (Q2325916) (← links)
- Agreeable sets with matroidal constraints (Q2424653) (← links)
- Fair multi-cake cutting (Q2659057) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- (Q5018515) (← links)
- Fair Division (Q5150295) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)