Knowledge (XXG)

Algorithmic mechanism design

Source đź“ť

52:, in contrast to classical mechanism design in economics which often makes distributional assumptions about the agents. It also considers computational constraints to be of central importance: mechanisms that cannot be efficiently implemented in polynomial time are not considered to be viable solutions to a mechanism design problem. This often, for example, rules out the classic economic mechanism, the 39:
is to design a system for multiple self-interested participants, such that the participants' self-interested actions at equilibrium lead to good system performance. Typical objectives studied include revenue maximization and social welfare maximization. Algorithmic mechanism design differs from
96: 53: 138: 224: 235: 41: 81: 272: 76: 211: 163: 91: 40:
classical economic mechanism design in several respects. It typically employs the analytic tools of
277: 168: 49: 45: 67:
and Amir Ronen first coined "Algorithmic mechanism design" in a research paper published in 1999.
220: 134: 173: 124: 36: 32: 203: 244: 195: 266: 207: 28: 243:, Seminar Report, University of Karlsruhe, Fakultät für Informatik, archived from 24: 199: 116: 64: 177: 121:
Proceedings of the thirty-first annual ACM symposium on Theory of Computing
129: 119:; Ronen, Amir (1999), "Algorithmic mechanism design (Extended abstract)", 86: 154:
Nisan, Noam; Ronen, Amir (2001). "Algorithmic Mechanism Design".
234:DĂĽtting, Paul; Geiger, Andreas (May 9, 2007), 219:. Cambridge, UK: Cambridge University Press. 8: 167: 128: 108: 23:) lies at the intersection of economic 7: 14: 97:Vickrey–Clarke–Groves mechanism 35:. The prototypical problem in 1: 54:Vickrey–Clarke–Groves auction 237:Algorithmic Mechanism Design 42:theoretical computer science 17:Algorithmic mechanism design 156:Games and Economic Behavior 82:Computational social choice 294: 213:Algorithmic Game Theory 77:Algorithmic game theory 178:10.1006/game.1999.0790 130:10.1145/301250.301287 123:, pp. 129–140, 103:References and notes 92:Incentive compatible 50:approximation ratios 46:worst case analysis 196:Vazirani, Vijay V. 285: 273:Mechanism design 258: 257: 255: 250:on June 13, 2015 249: 242: 230: 218: 204:Roughgarden, Tim 182: 181: 171: 162:(1–2): 166–196. 151: 145: 143: 132: 113: 37:mechanism design 33:computer science 293: 292: 288: 287: 286: 284: 283: 282: 263: 262: 253: 251: 247: 240: 233: 227: 216: 194: 191: 189:Further reading 186: 185: 153: 152: 148: 141: 115: 114: 110: 105: 73: 62: 12: 11: 5: 291: 289: 281: 280: 275: 265: 264: 261: 260: 231: 225: 190: 187: 184: 183: 169:10.1.1.16.7473 146: 140:978-1581130676 139: 107: 106: 104: 101: 100: 99: 94: 89: 84: 79: 72: 69: 61: 58: 13: 10: 9: 6: 4: 3: 2: 290: 279: 276: 274: 271: 270: 268: 246: 239: 238: 232: 228: 226:0-521-87282-0 222: 215: 214: 209: 205: 201: 197: 193: 192: 188: 179: 175: 170: 165: 161: 157: 150: 147: 142: 136: 131: 126: 122: 118: 112: 109: 102: 98: 95: 93: 90: 88: 85: 83: 80: 78: 75: 74: 70: 68: 66: 59: 57: 55: 51: 47: 43: 38: 34: 30: 26: 22: 18: 252:, retrieved 245:the original 236: 212: 159: 155: 149: 120: 111: 63: 29:optimization 20: 16: 15: 208:Tardos, Éva 200:Nisan, Noam 117:Nisan, Noam 25:game theory 278:Algorithms 267:Categories 65:Noam Nisan 44:, such as 164:CiteSeerX 254:June 11, 210:(2007). 87:Metagame 71:See also 60:History 223:  166:  137:  31:, and 248:(PDF) 241:(PDF) 217:(PDF) 256:2015 221:ISBN 135:ISBN 48:and 174:doi 125:doi 21:AMD 269:: 206:; 202:; 198:; 172:. 160:35 158:. 133:, 56:. 27:, 259:. 229:. 180:. 176:: 144:. 127:: 19:(

Index

game theory
optimization
computer science
mechanism design
theoretical computer science
worst case analysis
approximation ratios
Vickrey–Clarke–Groves auction
Noam Nisan
Algorithmic game theory
Computational social choice
Metagame
Incentive compatible
Vickrey–Clarke–Groves mechanism
Nisan, Noam
doi
10.1145/301250.301287
ISBN
978-1581130676
CiteSeerX
10.1.1.16.7473
doi
10.1006/game.1999.0790
Vazirani, Vijay V.
Nisan, Noam
Roughgarden, Tim
Tardos, Éva
Algorithmic Game Theory
ISBN
0-521-87282-0

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑