Pages that link to "Item:Q5494857"
From MaRDI portal
The following pages link to False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time (Q5494857):
Displayed 10 items.
- The excess formulations and related results for the normalized Banzhaf index and the Shapley value (Q286209) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Analyzing power in weighted voting games with super-increasing weights (Q1733386) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- Controlling weighted voting games by deleting or adding players with or without changing the quota (Q2169970) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Manipulation in communication structures of graph-restricted weighted voting games (Q2695440) (← links)
- Analyzing Power in Weighted Voting Games with Super-Increasing Weights (Q2819457) (← links)
- Duplication monotonicity in the allocation of indivisible goods (Q5145454) (← links)
- Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation (Q5154768) (← links)
